In computer science, a double-ended queue (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 of a deque (see below).
|is dbo:wikiPageDisambiguates of|
|is dbo:wikiPageRedirects of|
|is dbo:wikiPageWikiLink of|
|is owl:differentFrom of|
|is foaf:primaryTopic of|