39平衡二叉树

题目描述

输入一棵二叉树，判断该二叉树是否是平衡二叉树。

思路分析

平衡二叉树根据定义，父结点需要子结点两个信息：一是左右子树是否平衡，二是左右子树的高度差是否<=1，注意在最终返回数据时，返回左右子树的最大高度+1（头结点）。我们可以自己建立一个结构实现。

代码实现

public static ResultData isBalanced_Solution(TreeNode root) {
    if (root == null) {
        return new ResultData(0, true);
    }
    ResultData left = isBalanced_Solution(root.left);
    if (!left.isBalanced) {
        return new ResultData(0, false);
    }
    ResultData right = isBalanced_Solution(root.right);
    if (!right.isBalanced) {
        return new ResultData(0, false);
    }
    if (Math.abs(left.height - right.height) > 1) {
        return new ResultData(0, false);
    }
    return new ResultData(1 + Math.max(left.height, right.height), true);
}

public static boolean IsBalanced_Solution(TreeNode root) {
    ResultData resultData = isBalanced_Solution(root);
    return resultData.isBalanced;
}

private static class ResultData {
    int height;
    boolean isBalanced;

    public ResultData(int height, boolean isBanlanced) {
        this.height = height;
        this.isBalanced = isBanlanced;
    }
}