In computer science, a double-ended queue (dequeue, often abbreviated to deque, pronounced deck) is an abstract data type 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.
Read more about Double-ended Queue: Naming Conventions, Distinctions and Sub-types, Operations, Implementations, Language Support, Complexity, Applications
Famous quotes containing the word queue:
“English people apparently queue up as a sort of hobby. A family man might pass a mild autumn evening by taking the wife and kids to stand in the cinema queue for a while and then leading them over for a few minutes in the sweetshop queue and then, as a special treat for the kids, saying “Perhaps we’ve time to have a look at the Number Thirty-One bus queue before we turn in.””
—Calvin Trillin (b. 1940)