Explains union-find with analogies, path compression, and common applications like connected components and Kruskal.
Introduces graph representations, tree properties, and Kahn's algorithm for topological sorting.