Tree problems model hierarchical relationships. File systems, organizational charts, and game trees are all trees. Algorithms on trees compute distances, find ancestors, aggregate subtree values, and optimize over all possible roots.
Problems that would be NP-hard on general graphs become solvable in polynomial time on trees. Longest path, for instance, is linear on trees but exponential on general graphs.
