Image: Wikimedia Commons

queue

Abstract data type

Entitydata type abstract data typeQ220543

Also known as queue data type · queue data structure

Instance of: data type
, abstract data type
Subclass of: container
Part of: queue and stack

Overview

From Wikipedia, the free encyclopedia · Read full article · Text CC BY-SA 4.0

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.

Overview

All data

22 statements · 18% with external sources · numbers in brackets are citations

IPA transcription: ʈ͡ʂu˥˩lie˥˩ language: Traditional Chinese
Has characteristic: FIFO
Different from: double-ended queue
priority queue

On other databases

13 identifiers linking queue across the web's reference databases

Data quality

statements

18%

externally sourced

Source last edited September 20, 2026. AIDB refreshes this page daily.

Suggest a fact or correction

Links

Use this data

curl https://aidb.si/api/v1/entities/Q220543

API docs, limits & keys

Cite this page

AIDB. (2026). queue (Q220543). Retrieved from https://aidb.si/e/queue-Q220543