Chapter 5, Problem 2R

Explanation of Solution

Queue:

• A queue is a container of objects. The objects are added or deleted according to the first-in-first-out (FIFO) principle.
• The example of a queue is a line of students in food court of the UC. The new additions to a line are done at the back of the queue and the removal will happen at the front.
• The queue allows only two operations which are “enqueue” and “dequeue”.
• The “enqueue” operation adds the items into the back of the queue.
• The “dequeue” operation deletes the items from the front of the queue.

Implementation:

• In the standard library of class, the queue datatype is an adapter. This means a queue is built on the top of other data structures...