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