LetCode 110. 平衡二叉树

/**
 * 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) {
        if (checkDepth(root) == -1) return false;
        else return true;
    }
    int checkDepth(TreeNode *root) {
        if (!root) return 0;
        int left = checkDepth(root->left);
        // 左子树不平衡时直接返回-1
        if (left == -1) return -1;
        int right = checkDepth(root->right);
        // 右子树不平衡时直接返回-1
        if (right == -1) return -1;
        int diff = abs(left - right);
        // 左右子树高度相差大于1时不平衡，直接返回-1
        if (diff > 1) return -1;
        // 否则直接返回左右子树最大高度加上1
        else return 1 + max(left, right);
    }
};

static int x=[](){
    std::ios::sync_with_stdio(false);
    cin.tie(NULL);
    return 0;
}();