What is "double-ended queue"

n. (context computing English) An abstract list-type data structure where elements can be added to or removed from the front (head) or the back (tail).

In computer science, a double-ended queue (dequeue, often abbreviated to deque, pronounced deck) is an abstract data type that generalizes a queue, for which elements can be added to or removed from either the front (head) or back (tail). It is also often called a head-tail linked list, though properly this refers to a specific data structure implementation (see below).