Given a binary tree, determine if it is height-balanced.
For this problem, a height-balanced binary tree is defined as:
a binary tree in which the depth of the two subtrees of every node never differ by more than 1.
Example 1:
Given the following tree [3,9,20,null,null,15,7]
:
3 / \ 9 20 / \ 15 7
Return true.
Example 2:
Given the following tree [1,2,2,3,3,null,null,4,4]
:
1 / \ 2 2 / \ 3 3 / \ 4 4
Return false.
function isBalanced($root) {
if ($root === null) return true;
return $this->depth($root)!==-1;
}
function depth($root) {
if ($root === null) return 0;
$leftDepth = $this->depth($root->left);
$rightDepth = $this->depth($root->right);
if( $leftDepth==-1||$rightDepth==-1||abs($leftDepth-$rightDepth)>1){
return -1;
}else{
return max($leftDepth,$rightDepth)+1;
}
}