#424Medium#6 in NVIDIA's list· asked at 22 companies
Diameter of Binary Tree
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: root = [1,2,3,4,5] Output: 3
The path 4 -> 2 -> 1 -> 3 or 5 -> 2 -> 1 -> 3.
Example 2
Input: root = [1,2] Output: 1
Constraints
- •
The number of nodes in the tree is in the range
[1, 10^4]. - •
-100 <= Node.val <= 100