Groups
Category
DSU on Tree (also called the Sack technique) answers many subtree queries in O(n \log n) by keeping data from the heavy child and temporarily re-adding light subtrees.
Centroid decomposition splits a tree around a special node (centroid) so that every remaining component has at most half the nodes.