[Data Structure] Deque (ADT)

A deque (pronounced "deck" and short for double-ended queue) is an ADT in which items can be inserted and removed at both the front and back.

The deque push-front operation inserts an item at the front of the deque, and the push-back operation inserts at the back of the deque.

The pop-front operation removes and returns the item at the front of the deque, and the pop-back operation removes and returns the item at the back of the deque.

 

 

 

Some Common Operations of Deque ADT