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
Wires#3501
Easy
Square#3502
Medium
Root NIM#3505
Easy
AYBABTU#3561
Hard
Tree Count#3580
Hard
Tree#3710
Medium
Expressions#3837
Hard
Tree#3849
Medium
Forum#3922
Easy
Mancunian And Colored Tree#3983
Very easy
Bird tree#4009
Medium
Post-Order Traversal of a Tree#4038
Very easy
Tree#4173
Very hard
Center of the tree#4235
Very easy
Hashigo Sama#4299
Very hard
Tree#4325
Hard
Postal Reform#4328
Very easy
Turning Turtles#4350
Very easy
Three Bit Computer#4379
Very hard