1. Priority Queues 1 - Heaps
2. Priority Queues 2 - Binomial Heaps
3. Dictionaries
4. AVL Trees
5. Dynamic Order Statistics
6. Hash Tables
7. Bloom Filters
8. Randomized Quicksort
9. Disjoint Sets
10. Amortized Analysis
11. Dynamic Tables
12. Graph Search 1 - Breadth First Search
13. Graph Search 2 - Depth First Search
14. Minimum Spanning Trees 1 - Kruskal’s Algorithm
15. Minimum Spanning Trees 2 - Prim’s Algorithm
16. Metric Travelling Salesman Problem Approximation via MSTs
17. Lower Bounds on Sorting with Decision Trees