Double-ended queue
Abstract data type / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Double-ended queue?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
"Deque" redirects here. Not to be confused with dequeueing, a queue operation.
Not to be confused with Double-ended priority queue.
In computer science, a double-ended queue (abbreviated to deque, pronounced deck, like "cheque"[1]) 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).[2] It is also often called a head-tail linked list, though properly this refers to a specific data structure implementation of a deque (see below).
This article may be too technical for most readers to understand. (April 2022) |