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 ofevery node never differ by more than 1.
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int getDepth(TreeNode* node){
if(node==NULL){
return 0;
}
int left=getDepth(node->left);
if(left==-1){
return -1;
}
int right=getDepth(node->right);
if(right==-1||abs(left-right)>1){
return -1;
}else{
return max(left,right)+1;
}
}
bool isBalanced(TreeNode *root) {
return getDepth(root)==-1?false:true;
}
};