Dev
Mentor
Coach Interview AI
Mock Interview AI
Coding Problems
Blog
Pricing
Toggle theme
Sign In
Get Started
Toggle theme
Loading...
For the best coding experience, use a desktop browser.
Easy
Tree
Diameter of Binary Tree
Return length of longest path between any two nodes (may not pass root).
Examples
Input:
root = [1,2,3,4,5]
Output:
3
Sample Test Cases
Case 1 Input:
[1,2,3,4,5]
Expected:
3
Case 2 Input:
[1,2]
Expected:
1
Reset
Run
Submit
Loading editor...
Test Case
Output
Submission
Case 1 Input:
[1,2,3,4,5]
Expected:
3
Case 2 Input:
[1,2]
Expected:
1