• [x] 2023-01-10 - Syllabus, Review
• [x] 2023-01-12 - Average Case Analysis, Linked List Search
• [x] 2023-01-17 - Priority Queue, Heap
• [x] 2023-01-19 - Heap Operations
• [x] 2023-01-24 - Heapsort, Dictionary, Binary Search Tree
• [x] 2023-01-26 - AVL Tree
• [x] 2023-01-31 - AVL Double-rotation, Code Insert, Rotate, Rebalance
• [x] 2023-02-02 - AVL Delete, DeleteMax, Augmentation
• [x] 2023-02-07 - Augmentation, Ordered Set (Rank & Select)
• [x] 2023-02-09 - Ordered Set (Insert, Delete), Hash-Table
• [x] 2023-02-14 - Hash-table Average Case, Open Addressing (Probing)
• [x] 2023-02-16 - Open Addressing, Hash Functions, Quicksort (Worst case)
• [x] 2023-02-28 - Quicksort Average Case, Amortized Analysis, Binary counter example
• [x] 2023-03-02 - Dynamic Array
• [x] 2023-03-07 - Graphs, BFS
• [x] 2023-03-09 - BFS, BFS Minimum distance proof
• [x] 2023-03-14 - DFS
• [x] 2023-03-16 - DFS, Parenthesis Theorem, Cycle detection, Topological sorting
• [x] 2023-03-21 - DFS Strongly Connected Components, Minimum Spanning Tree, Prim’s Algo
• [x] 2023-03-23 - Prim’s Algo, Kruskal’s Algo, Disjoint Sets ADT