a doubly-ended queue, which permits insertions and deletions at both the front and rear
a list of elements which may be added to or subtracted from at each end
a sequence of items which allows you to add new items to either end or remove items from either end
A queue that can have elements added and removed at both ends. A double-ended queue.
(n.) a double ended queue; that is a list of elements on which insertions and deletions can be performed at both the front and rear.
In computer science, a deque (short for double-ended queue) is an abstract data structure for which elements can be added to or removed from the front or back. This differs from a normal queue, where elements can only be added to one end and removed from the other. Both queues and stacks can be considered specializations of deques, and can be implemented using deques.