Queues

Queues are container adaptors that store elements in a first-in-first-out (FIFO) order. Elements inserted into the queue first are removed first.

Syntax

#include <queue>

queue<type> queueName;

type is the data type that will be stored in the queue.

Codebyte Example

The following codebyte example creates an empty queue, adds elements using the .push() method, and then prints the elements from the queue:

Queues

.empty()
Checks if a queue has no elements.
.front()
Returns the next element within the queue.
.pop()
Removes the element at the front of the queue.
.push()
Adds an element to the back of the queue.
.size()
Returns the number of elements in the queue.
Edit this page on GitHub

Contributors

Interested in helping build Docs? Read the Contribution Guide or share your feedback form.

Learn C++ on Codecademy