Implementations of data structures and algorithms I learned at UofT.
Highlights of content:
- Balanced BST (AVL Tree)
- Heaps/PriorityQueue
- Hashmaps
- Disjoin Set
- Graphs, DFS, BFS, topological sort, minimum spanning trees (Prim's, Kruskal's)
- Divide and conquer algorithms
- Greedy algorithms
- Dynamic programming