Tree Diameter / Longest Path

Members only

LeetCode 543 / 1245. Longest path between any two nodes in a tree. DFS returns the deepest descendant chain; at each node, the diameter candidate is the sum of the two longest child chains.