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.
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.
Julian F.
Head of Cybersecurity
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.
Addison B.
Field Engineer
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.
Amir M.
Data Platform Tech Lead
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.