Double-Ended Queue Abstract Data Type
(Redirected from Double-Ended Queue ADT)
Jump to navigation
Jump to search
A Double-Ended Queue Abstract Data Type is a Collection Abstract Data Type that supports a Head Enqueue Operation, Tail Enqueue Operation, Head Dequeue Operation and Tail Dequeue Opoeration.
- AKA: dequeue ADT.
- Context:
- It can generalize a Queue ADT.
- See: Abstract Data Type, Queue (Data Structure), Data Structure.
References
2014
- (Wikipedia, 2014) ⇒ http://en.wikipedia.org/wiki/Double-ended_queue Retrieved:2014-4-21.
- In computer science, a double-ended queue (dequeue, often abbreviated to deque, pronounced deck) is an abstract data type that generalizes a queue, for which elements can be added to or removed from either the front (head) or back (tail). [1] It is also often called a head-tail linked list, though properly this refers to a specific data structure implementation (see below).
- ↑ Donald Knuth. The Art of Computer Programming, Volume 1: Fundamental Algorithms, Third Edition. Addison-Wesley, 1997. ISBN 0-201-89683-4. Section 2.2.1: Stacks, Queues, and Deques, pp. 238–243.