59. Diameter of a Binary Tree
MediumTrees
Return the number of edges on the longest path between any two nodes of the tree. The path may or may not pass through the root.
A binary tree is passed as TreeNode objects with val, left and right. The tests write trees in level order, with null for a missing child.
Example 1
Input: root = [1, 2, 3, 4, 5] Output: 3 Explanation: 4 → 2 → 1 → 3
Constraints
1 ≤ nodes ≤ 10⁴