Double-ended queue

A deque (double- ended queue, pronounced " deck " ) refers to a data structure of computer science.

This is similar to the queue, or the stack is a data structure. The difference is that the data can be read is inserted or removed at both ends.

The operations of the deque are:

• PUSH and POP for the insertion or removal of a member at the rear end of the deque.
• PUT and GET for inserting or removing the front end of the deque.
• FIRST and LAST for reading the first or last element, without removing it.

Technically, the deque is either implemented as a doubly linked list - that is similar to the queue, or the stack - or the field with an auxiliary indices.

In practice, one uses the deque among other things, implementation of non-deterministic finite automaton and text search using regular expressions ( pattern matching algorithm)

In the esoteric programming language " alphabet" is a deque ( known there as " Queack " ) available as a single data structure.