(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.
Note: Short for Double-Ended QUEue. Pronounced "deck". After [Knuth97, 1:239, Sect. 2.2.1].
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 20 November 2008.
HTML page formatted Fri Sep 4 11:48:36 2009.
Cite this as:
Paul E. Black, "deque", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 20 November 2008. (accessed TODAY)
Available from: http://www.itl.nist.gov/div897/sqg/dads/HTML/deque.html
