Skip to Main Content
Data Structures Using C, 2nd Edition by Pearson
book

Data Structures Using C, 2nd Edition by Pearson

by A. K. Sharma
May 2024
Intermediate to advanced content levelIntermediate to advanced
521 pages
14h 12m
English
Pearson India
Content preview from Data Structures Using C, 2nd Edition by Pearson
266 Data Structures Using C
It may be noted that with the help of dummy nodes, the basic nature of linked lists remains
intact.
6.6 LINKED STACKS
We know that a stack is a LIFO (last in first out) data structure. Earlier
in the book, the stack was implemented using an array. Though the
array implementation was efficient but a considerable amount of storage
space was wasted in the form of unutilized locations of the array. For
example, let us assume that at a given time, there are five elements in a
stack. If the stack is implemented using 20 locations, then 15 locations
out of 20 are being wasted.
A solution to this problem is dynamic storag ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Data Structures Using C

Data Structures Using C

Samir Kumar Bandyopadhyay, Kashi Nath Dey
Intermediate C Programming, 2nd Edition

Intermediate C Programming, 2nd Edition

Yung-Hsiang Lu, George K. Thiruvathukal

Publisher Resources

ISBN: 9781299831582