Next: 2.5 To Probe Further
Up: 2.4 Queues
Previous: 2.4.2 Circular Array Implementation
- A linked list in which the node at the tail of the list, instead of
having a null pointer, points back to the node at the head of the list. Thus
both ends of a list can be accessed using a single pointer.
See Figure 2.11.
Circular linked list implementation of a queue
- If we implement a queue as a circularly linked list, then we need only
one pointer namely tail, to locate both the front and the back.