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.
思路:根据dfs思想,递归的求解左子树和右子树的深度,并且判断
bool isBalanced(TreeNode* root) {
if(!root)return true;
if(abs(h(root->left)-h(root->right))>1){
return false;
}
return isBalanced(root->left)&&isBalanced(root->right);
}
int h(TreeNode* root){
if(!root)return 0;
int l = h(root->left);
int r = h(root->right);
return l>r?(l+1):(r+1);
}