Double-ended queue

This article's lead section may be too short to adequately summarize the key points. Please consider expanding the lead to provide an accessible overview of all important aspects of the article. (April 2022)

This article may be too technical for most readers to understand. Please help improve it to make it understandable to non-experts, without removing the technical details. (April 2022) (Learn how and when to remove this message)

In computer science, a double-ended queue (abbreviated to deque, /dɛk/ DEK^[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).