- Breadth-first search (BFS)
- Deep-first search (DFS)
- Greatest common divisor calculation (Euclidean algorithm, GCD)
- Stack
- Linked list
- Hash-map
- Naive binary search tree (BST)
- Red-black tree
- Treap (TODO)
- Segment tree (for RSQ, RMQ, ect; not finished yet!)
Number of different logical exercises