CSES 1132 Tree Distances I - Problem Statement

You are given a tree with $n$ nodes. For each node, calculate the maximum distance from that node to any other node. This extends diameter to all nodes. Naive approach: run BFS from every node, $O(n^2)$.

Better approach: use the diameter endpoints. For any node $v$, its farthest node is one of the diameter endpoints. Run BFS from both endpoints, then answer for each node is max of the two distances.

Space complexity is $O(n)$ for the data structures used.