- Last in first out (LIFO)
- Basic operations: Enqueue, Dequeue, Peek
- Can be implemented with a linked nodes, array, or two stacks.
- Easily maps to many problems.
- Quick inserts and deletes
- Not ideal for search operations.
- Cannot easily add or remove elements in the middle.