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
264 Data Structures Using C
6.5 THE CONCEPT OF DUMMY NODES
The linked list and its variants, discussed above, have a major drawback. Every algorithm has to take care
of special cases. For instance, besides a normal operation, an algorithm has to make sure that it works for
the following exceptional or boundary cases:
(1) the empty list
(2) on the head element of the list
(3) on the last element of the list
The above situation occurs when a node in a linked list has no predecessor or a successor. For
example, the first node in a linked list has no predecessor and, therefore, insertion or deletion at the end
requires a special case. Similarly ...
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