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:
    bool isBalanced(TreeNode *root) {
        if(root == NULL)
            return true;
        bool result = true;
        helper(root, result);
        return result;
    }
private:
    int helper(TreeNode *node, bool &flag)
    {
        if(flag == false)
            return 0;
        if(node == NULL)
            return 0;
        if(node->left == NULL && node->right == NULL)
            return 1;
        int left = helper(node->left, flag)+1;
        int right = helper(node->right, flag)+1;
        if(std::abs(left - right) > 1)
            flag = false;
        return std::max(left, right);
    }
};

Round 3:

/**
 * 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) {
        bool flag = true;
        getDepth(root, flag);
        return flag;
    }
private:
    int getDepth(TreeNode *root, bool &flag)
    {
        if(root == NULL)
            return 0;
        if(flag == false)
            return -1;
        if(root->left == NULL && root->right == NULL)
            return 1;
        int left = getDepth(root->left, flag) + 1;
        int right = getDepth(root->right, flag) + 1;
        if(std::abs(left - right) > 1)
        {
            flag = false;
            return -1;
        }
        return std::max(left, right);
    }
};