The dequeue stands for Double Ended Queue. ... Deque is a linear data structure in which the insertion and deletion operations are performed from both ends. We can say that deque is a generalized version of the queue.

What do you mean by dequeue in data structure?

A deque, also known as a double-ended queue, is an ordered collection of items similar to the queue. It has two ends, a front and a rear, and the items remain positioned in the collection. ... In a sense, this hybrid linear structure provides all the capabilities of stacks and queues in a single data structure.

Is deque a FIFO data structure?

After the stack, the next simplest data abstraction is the queue. ... Just as a stack was described as a LIFO (last-in, first-out) container, this means a queue can be described as FIFO (first in, first out). A variation is termed the deque, pronounced “deck”, which stands for double-ended queue.