Chapter 18, Problem 11RQE

Explanation of Solution

STL:

STL stands for “Standard Template Library”. STL provides two containers that are used for implementing queue-like data structures. They are:

• Queue
• Deque

Queue container adapter:

• It is built upon deques, vectors or lists.
• By default, it uses “deque” type.
• The insertion operation and deletion operation are same as the “stack ADT” (push, pop, and front).
  • When pushing an element, the element is added at the rear end.
  • The element is popped at the front end.
  • The function “front ()” returns the element which is present at the front position...