Bounded stack · LIFO

A stack removes the most recently added item first. A bounded stack rejects pushes when full.

Remember: Last in, first out.

Example: Push 2, push 4, pop → 4.

Time: O(1) / op. Auxiliary space: O(capacity).

Formula: top index = size − 1

Commands: push VALUE; pop. Overflow and underflow reject only that command.

Complexities describe the underlying algorithm; tutorial snapshots and rendering can use additional resources.

The interactive workspace loads here when JavaScript is available. You can still browse the learning notes and links above without it.