Abstract data type for which elements can be added to or removed from either the front or back
Also known as deque · dequeue · double ended queue
6 statements · 17% with external sources · numbers in brackets are citations
3 identifiers linking double-ended queue across the web's reference databases
From Wikipedia, the free encyclopedia · Read full article · Text CC BY-SA 4.0
In computer science, a double-ended queue, is an abstract data type that serves as a container, with a restricted access to the stored items. As a generalization of both the stack and the queue, the deque may have similar functions as a data buffer: it can be use both as a retainer (queue), or for backtracking (stack). However it offers greater flexibility in managing the order of elements and some algorithms are based on its functionalities.