Working Ordered linked list:
• Eachinteger in the queue is stored inside of a QueueItem. The QueueItem contains the integer, and a pointer to the next item in the queue.
For example, the QueueItem below stores aninteger16 and the next pointer has been set to NULL.
• The Queue class has two member variables, head and tail, which point to the first and the last item in the queue, respectively. Both of these start off as NULL pointers.
• When push is called, a new QueueItem is created with that integer stored. This is placed at the back of the queue
For example, if we inserted 7 in the empty queue above, the head and tail pointers would simply be set to point to this new item.
• Now, say we pushed10 onto the queue. We want this to be inserted at the end of the queue as shown below, with the tail pointer pointing to the newly inserted item
• Now push45 and 16 onto the queue
• Removal is done from the front of the queue, if we called pop the result would be
