Trees

Problems on trees, including traversals, depths and subtree sizes, diameters and centres, lowest common ancestors, binary trees, minimum spanning trees, centroid decomposition, and dynamic programming on subtrees.

The Graphs section of the library covers depth-first search, breadth-first search, Kruskal's and Prim's algorithms. Related problem sets are under Graphs, Depth-first search and Disjoint set union.