File:Data_Queue.svg · Wikimedia Commons · See Wikimedia Commons
Key facts
- Operation
- Average
- Search
- O( n )
- Insert
- O(1)
- Delete
- O(1)
- Space
- O( n )
via Wikipedia infobox
Wikidata facts
- Image
- Data Queue-ar.svg
Show 3 more facts
- Commons category
- Queue data structure
- IPA transcription
- ʈ͡ʂu˥˩lie˥˩
- Stack Exchange tag
- stackoverflow.com/tags/queue
Sources (2)
via Wikidata · CC0
~12 min read
Article
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
Gallery (2)
Connections
abstract data type
Entity
list of data structures
Entity
transport
Entity
computer science
Entity
International Standard Book Number
Entity
digital object identifier
Entity
Q42478
Entity
Q161053
Entity
Donald Knuth
Entity
data structure
Entity
analogy
Entity
pointer
Entity
stack
Entity
high-level programming language
Entity
array data structure
Entity
operations research
Entity
tree
Entity
hash table
Entity
linked list
Entity
heap
Entity