Leetcode 834. Sum of Distances in Tree

Given a tree with n (≤ 3·10^4) nodes, compute for every node the sum of distances to all other nodes. This requires an O(n) tree-DP / rerooting approach (aggregate subtree sizes and distance sums, then propagate results) rather than repeated BFS from each node.