Queue Abstract Data Type

A queue ADT supports two main operations:

The order in which elements are removed gives rise to the term FIFO (first in, first out) to describe a queue.

It helps to visualize a queue as an ADT where elements are removed from the front but added to the back, analogously to when people line up to wait for goods or services.

A queue has a variety of applications such as: