Question

What two queue-like containers does the STL offer?

Short answer

Answer: The two queue-like containers provided by the C++ STL are 'queue' and 'priority_queue'.

Step-by-step solution

Identify the first queue-like container

The first queue-like container provided by the C++ STL is 'queue'. It is a container adaptor that offers first-in first-out (FIFO) functionality. Elements are inserted at the back of the queue and removed from the front.

Identify the second queue-like container

The second queue-like container provided by the C++ STL is 'priority_queue'. It is also a container adaptor, however, it differs from 'queue' in the way that elements are removed. In a 'priority_queue', elements are removed from the container based on their priority, which is determined by their value. The highest priority element (i.e. the element with the highest value) is always at the top, and elements are removed in descending order of their priority. So, the two queue-like containers provided by the C++ STL are 'queue' and 'priority_queue'.