(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 [Knuth98, vol 1, page 239].
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 17 December 2004.
HTML page formatted Mon Sep 11 09:46:02 2006.
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. 17 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/deque.html