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.35A linked queue
Front
Rear
NULL
Fig. 6.36The 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.