LeetCode 543 Diameter of Binary Tree - Implementation Details

The implementation follows the Tree DP template:

$1.$ Define a recursive function that returns height.

$2.$ At each node, compute left height and right height.

$3.$ Update diameter = max(diameter, leftH + rightH) as a side effect.

$4.$ Return 1 + max(leftH, rightH) to the parent.

This runs in $O(n)$ time and $O(h)$ space. You will write the full code in the Tree Diameter & Center section.