平衡树

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


int getHeight(TreeNode *root)
{
if(root==NULL)
return 0;
int leftHeight=getHeight(root->left);
if(leftHeight==-1)
return -1;
int rightHeight=getHeight(root->right);
if(rightHeight==-1)
return -1;
int diff=leftHeight-rightHeight;
if(abs(diff)>1)
return -1;
else return max(leftHeight,rightHeight)+1;




}


bool isBalanced(TreeNode *root)
{
if(getHeight(root)==-1)
return false;
else return true;
}