【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 binary tree
* struct TreeNode {
*     int val;
*     TreeNode *left;
*     TreeNode *right;
*     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int GetHeight(TreeNode *node, bool &balanced)
{
if(node == NULL) return -1;
int i = GetHeight(node->left, balanced);
int j = GetHeight(node->right, balanced);
if(abs(i-j) > 1) balanced = false;
return max(i, j) + 1;
}
bool isBalanced(TreeNode *root)
{
bool balanced = true;
int i = GetHeight(root, balanced);
return balanced;
}
};