Editing Double-ended queue (section)

==Distinctions and sub-types==
This differs from the queue abstract data type or ''first in first out'' list ([[FIFO (computing and electronics)|FIFO]]), where elements can only be added to one end and removed from the other. This general data class has some possible sub-types:

*An input-restricted deque is one where deletion can be made from both ends, but insertion can be made at one end only.
*An output-restricted deque is one where insertion can be made at both ends, but deletion can be made from one end only.

Both the basic and most common list types in computing, [[queue (data structure)|queue]]s and [[stack (data structure)|stack]]s can be considered specializations of deques, and can be implemented using deques. A deque is a data structure that allows users to perform push and pop operations at both ends, providing flexibility in managing the order of elements.