110. 平衡二叉树

链接：https://leetcode-cn.com/problems/balanced-binary-tree/

/**
 * 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 is_balanced = true;
            is_balance(root,&is_balanced);
            return is_balanced;
        }
        int is_balance(TreeNode* root, bool* is_balanced) {
            if (root == nullptr) { 
                return 0;
            }
            int left = is_balance(root->left, is_balanced);
            int right = is_balance(root->right, is_balanced);
            if (!(*is_balanced) || abs(left-right) > 1) {
                (*is_balanced) = false;
            }
            return max(left, right)+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:
    bool isBalanced(TreeNode* root) {
        bool balance = true;
        is_balance(root, &balance);
        return balance;
    }
    int is_balance(TreeNode* root, bool* balance) {
        if(!root || !(*balance)) {
            return 0;
        }
        int left = is_balance(root->left, balance);
        int right = is_balance(root->right, balance);
        if(abs(left-right) > 1) {
            (*balance) = false;
            return 0;
        }
        return max(left, right)+1;
    }
};