NIST

deque

(data structure)

Definition: A data structure in which items may be added to or deleted from the head or the tail.

Also known as doubly-ended queue.

See also queue, stack.

Note: Short for Double-Ended QUEue. Pronounced "deck". After [Knuth97, 1:239, Sect. 2.2.1].

Author: PEB


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 20 November 2008.
HTML page formatted Fri Feb 23 10:06:07 2018.

Cite this as:
Paul E. Black, "deque", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 20 November 2008. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/deque.html