Queue

Related terms

• 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.
• Deque — A double-ended queue: push and pop at both the front and the back, all in O(1) amortized. A ring buffer with growth implements it well.
• 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