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 everynode 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.
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool flag=true;
int getheight(TreeNode* root){
if(root){
int left=getheight(root->left);
int right=getheight(root->right);
if(abs(left-right)>1){
flag=false;
}
int maxn=left>right?left:right;
return maxn+1;
}
else{
return 0;
}
}
bool isBalanced(TreeNode* root) {
getheight(root);
return flag;
}
};