Queue

In computer science, a queue is an abstract data type that serves as an ordered collection of entities. By convention, the end of the queue where elements are added is called the back, tail, or rear of the queue. The end of the queue where elements are removed is called the head or front of the queue.

The name queue is an analogy to the words used to describe people in line to wait for goods or services.
It supports two main operations.
Enqueue, which adds one element to the rear of the queue Dequeue, which removes one element from the front of the queue.

Back to Data Structures →

Source: Wikipedia · Image: Wikimedia Commons · CC BY-SA 3.0

ALGOHAY

Algorithms, demystified — data-structure guides, complexity tools, and interview prep for developers.

Get new guides by emailOccasional emails. No spam. Unsubscribe anytime.

InformationAbout Contact Privacy Policy Terms of Service Disclaimer Affiliate Disclosure Cookie Policy

Every algorithm, image, fact, and figure in the museum is drawn from Wikipedia and Wikimedia Commons, used under public-domain and Creative Commons licenses. No content is AI-generated.