Balanced Binary Tree
Given a binary tree, determine if it is height-balanced. A height-balanced binary tree is a binary tree in which the depth of the two subtrees of every node never differs by more than one.
Balanced Binary Tree

Given a binary tree, determine if it is height-balanced. A height-balanced binary tree is a binary tree in which the depth of the two subtrees of every node never differs by more than one.

Example 1:
Input: {"root":[3,9,20,null,null,15,7]}
Output: true
Input
arr ={"root":[3,9,20,null,null,15,7]}

3

9

20

15

7

Variables
VariableValue
curr3
DepthFunction Call
0dfsnode=3
0/25