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
270 Data Structures Using C
6.7 LINKED QUEUES
We know that a queue is a FIFO (first in first out) data structure. Since this data structure also involves
deletions and additions at front end and rear end respectively, a linked list is definitely a better choice
from the point of implementation.
A linked queue will have the same node structure as in the case of a stack as shown in Figure 6.35.
Two pointers called Front and Rear would keep track of the front and rear end of the queue.
Fig. 6.35 A linked queue
Front
Rear
NULL
Fig. 6.36 The linked queue after an addition operation
NULL
Front
Rear
ptr
Front
Rear
ptr
NULL
12
3
An algorithm for adding an element ...
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