Deque

Related terms

• Queue — A first-in, first-out collection: add at the back, remove from the front. Usually built on a ring buffer.
• Stack — A last-in, first-out collection: you only push and pop at one end. Typical uses are undo history, bracket matching and the call stack.
• Ring buffer — A fixed array with a head index and a count where positions wrap around with modulo, so removing from the front never shifts elements. When full it can double (copying once) to keep amortized O(1) pushes.

← All terms