Some of my favorite containers implemented in modern c++.
- list
- Single linked list.
- stack
- Stack. LIFO access order.
- queue
- Queue. FIFO access order.
- deque
- Double-ended queue.
- tree
- Binary tree.
- bst
- Binary search tree.
- heap
- Heap. Constant time access to maximum or minimum.
- trie
- Search by prefix.
- graph
- Adjacency list representation of a graph.
- hashtable
- Constant time insert and find.
- union_find
- Disjoint-set. Fast set membership lookup.
- maxstack
- Stack with constant time access to maximum value.
- maxqueue
- Queue with constant time access to maximum value.
- lru
- Map with a least recently used (LRU) eviction policy.