leetcode Balanced Binary Tree 树

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 a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
	int checkBalance(TreeNode *root) {
		if (root == NULL)
			return 0;
		int leftheight = checkBalance(root->left);
		int rightheight = checkBalance(root->right);
		if (leftheight == -1 || rightheight == -1)
		{
			return -1;
		}
		else if (abs(leftheight - rightheight) > 1)
		{
			return-1;
		}
		return max(leftheight, rightheight) + 1;
	}
	bool isBalanced(TreeNode* root) {
		if (root == NULL)return true;
		if (checkBalance(root)!=-1) 
		{
			return true;
		}
		else
		{
			return false;
		}
	}
};