/**
* 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 isBalanced(TreeNode* root) {
if(!root) return 1;
return isBalanced(root->right) && isBalanced(root->left) && abs(getHeight(root->right) - getHeight(root->left)) <= 1;
}
int getHeight(TreeNode* p)
{
if(!p) return 0;
return max(getHeight(p->left),getHeight(p->right)) + 1;
}
};