C + + Queues (queue)

C + + Queues (queue)

The C + + queue is a container adapter that gives programmers a first in, out (FIFO) data structure.
1.back () Returns a reference, pointing to the last element
2.empty () returns True if the queue is empty
3.front () returns the first element
4.pop () Delete the first element
5.push () Add an element at the end
6.size () returns the number of elements in the queue

The queue can be implemented with a linear table (list) or two-way queue (deque) (note that vector container cannot be used to implement a queue because the vector has no member function Pop_front

C + + Queues (queue)