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].
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 20 November 2008.
HTML page formatted Wed Mar 13 12:42:45 2019.
Cite this as:
Paul E. Black, "deque", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 20 November 2008. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/deque.html