Status: IN
The diameter algorithm correctly finds longest paths that don't pass through the root by checking `left_height + right_height` at every node during the DFS, not just at the root.
Source: entries/2026/06/06/diameter-of-binary-tree-solution.md