Dev
Mentor
Coach Interview AI
Mock Interview AI
Coding Problems
Blog
Pricing
Toggle theme
Sign In
Get Started
Toggle theme
Loading...
Loading...
Balanced Binary Tree — Coding Practice | DevMentor
For the best coding experience, use a desktop browser.
Easy
Tree
Balanced Binary Tree
Return true if height difference of subtrees is at most 1 for all nodes.
Examples
Input:
root = [3,9,20,null,null,15,7]
Output:
true
Sample Test Cases
Case 1 Input:
[3,9,20,null,null,15,7]
Expected:
true
Case 2 Input:
[1,2,2,3,3,null,null,4,4]
Expected:
false
Reset
Run
Submit
Loading editor...
Test Case
Output
Submission
Case 1 Input:
[3,9,20,null,null,15,7]
Expected:
true
Case 2 Input:
[1,2,2,3,3,null,null,4,4]
Expected:
false