CS 216
Data Structures and Algorithms

Spring 2026

---

Assignments

Assignment 11

reading: 5.1.5 (Prim Demo) | 5.1.1, 5.1.3 (Kruskal Demo) | 6.6 p. 172-173 (Floyd-Warshall Demo)
reading: Pseudocode | Run-Time Analysis

Assignment 10

reading: 3.1-3.2 (DFS Demo) | 4.1-4.3 (BFS Demo) | 4.4, skip 4.4.2 (Dijkstra Demo)
reading: Pseudocode | Run-Time Analysis

Assignment 9

reading: Min Heap | Heap Sort | Merge+Quick Sort Demo
reading: Merge Sort Notes | Quick Sort Notes

Assignment 8

reading: BTree Demo | RB-Tree Demo

reading: RB-Tree Insert | RB-Tree Height

reading: class notes, assignment diagrams

Assignment 7

Assignment 6

reading: Complexity Notes

Assignment 5

Assignment 4

Assignment 3

reading: removeAll

Assignment 2

Assignment 1