A personal and custom library that will eventually contain all the common data structures. The implementation uses templates and custom iterators to allow the usage of the common STL algorithms on the containers (where possible). The project also contains a custom (minimal) unit test framework.
- Singly Linked List (Forward List)
- Doubly Linked List (List)
- Binary Search Tree
- Graph
- Stack
- Queue
- Double Ended Queue (Deque)
- Treap
- Red-Black Tree
- AVL Tree
- Trie