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.
Problems
Random tree#11054
Very hard
Game with a tree#11055
Very hard
Jellyfish#11101
Very hard
Social Distancing#11106
Very hard
Bridges#11126
Hard
New White-Black Tree#11145
Very hard
Kefa and Park#11153
Very easy
Max Flow#11163
Easy
Even Tree#11263
Very easy
Tree Permutations#11281
Very hard
BinCoin#11321
Easy
Dead-End Detector#11348
Very hard
Hobson's Trains#11351
Very hard
Tree Distances I#11430
Medium
No legend#11514
Very hard
Tree#11515
Hard
Hit the road!#11516
Very hard
Conveyer#11536
Very hard