平衡树1

struct TreeNode
{
int val;
TreeNode *left;
TreeNode *right;
}


int getHeight(TreeNode *root)
{
if (root==NULL)
return 0;
return max(getHeight(root->left),getHeight(root->right))+1;
}


bool isBalanced(TreeNode *root)
{
if(root==NULL)
return true;
int lefth=getHeight(root->left);
int righth=getHeight(root->right);
int diff=abs(lefth-righth);
if(diff>1)
return false;
else return isBalanced(root->left)&&isBalanced(root->right);
}