CS-Notes/notes/55.2 平衡二叉树.md

55.2 平衡二叉树

NowCoder

题目描述

平衡二叉树左右子树高度差不超过 1。

解题思路

private boolean isBalanced = true;

public boolean IsBalanced_Solution(TreeNode root) {
    height(root);
    return isBalanced;
}

private int height(TreeNode root) {
    if (root == null || !isBalanced)
        return 0;
    int left = height(root.left);
    int right = height(root.right);
    if (Math.abs(left - right) > 1)
        isBalanced = false;
    return 1 + Math.max(left, right);
}