Определение double ended queue в Английский Язык Английский Язык словарь
An abstract list-type data structure where elements can be added to or removed from the front (head) or the back (tail)
(Bilgisayar) In computer science, a double-ended queue (often abbreviated to deque, pronounced deck) is an abstract data structure that implements a queue for which elements can only be added to or removed from the front (head) or back (tail). It is also often called a head-tail linked list