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
New Barns#10415
Very hard
MooTube (Silver)#10422
Medium
Sum of leaves#10432
Very easy
Sum of nodes in a subtree#10433
Very easy
Bandits in the Tree#10448
Very hard
Mr. V#10503
Medium
Delegation (Platinum)#10605
Very hard
XOR Sum#10653
Very easy
Unique Color#10654
Very easy
Virus Tree 2#10655
Very easy
Intervals on Tree#10667
Very easy
Roads Improvement#10684
Very easy
Федерація ООП#10708
Medium
Mentors#10727
Hard
Spanning Tree#10754
Very hard
One Piece#10889
Very hard
News#10953
Hard
Road Reparation#11001
Medium
Lumberjack villages#11033
Very hard