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].
The Standard C++ Library contains an implementation of a DeQue (std::deque).