110. 平衡二叉树

最新推荐文章于 2024-09-13 16:27:15 发布

代码无bug

最新推荐文章于 2024-09-13 16:27:15 发布

阅读量49

点赞数

分类专栏：数据结构（树）文章标签：算法数据结构 leetcode

本文链接：https://blog.csdn.net/aaronyyds/article/details/132352895

版权

数据结构（树）专栏收录该内容

58 篇文章 0 订阅

订阅专栏

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    int getHeight(TreeNode* node) {
        if (node == NULL) {
            return 0;
        }
        int leftHeight = getHeight(node->left);
        if (leftHeight == -1) return -1;
        int rightHeight = getHeight(node->right);
        if (rightHeight == -1) return -1;
        return abs(leftHeight - rightHeight) > 1 ? -1 : 1 + max(leftHeight, rightHeight);
    }
    
    bool isBalanced(TreeNode* root) {
        if(getHeight(root)==-1)return false;
        else return true;
    }
};