【树】检查平衡性

一、题目

. - 力扣（LeetCode）. - 备战技术面试？力扣提供海量技术面试资源，帮助你高效提升编程技能,轻松拿下世界 IT 名企 Dream Offer。https://leetcode.cn/problems/check-balance-lcci/?envType=problem-list-v2&envId=binary-tree&difficulty=EASY&status=TO_DO

二、题解

/**
 * 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 maxDepth(TreeNode* root) {
        if (root == NULL) return 0;

        int left = maxDepth(root->left), right = maxDepth(root->right);
        if (!~left|| !~right) return -1;

        return abs(left - right) <= 1 ? max(left, right) + 1 : -1;
    }

    bool isBalanced(TreeNode* root) {
        if (root == NULL) return 1;
        return ~maxDepth(root);
    }
};