Balanced-binary-tree

最新推荐文章于 2021-11-10 23:01:59 发布

原创最新推荐文章于 2021-11-10 23:01:59 发布 · 274 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一种用于判断二叉树是否为高度平衡的算法。通过递归计算每个节点的左右子树的最大深度，并确保任意节点的左右子树深度之差不超过1，实现了对平衡二叉树的有效识别。

题目描述

Given a binary tree, determine if it is height-balanced.

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public boolean isBalanced(TreeNode root) {
        if(root == null)
            return true;
        if(Math.abs(MaxDepth(root.left) - MaxDepth(root.right))>1)
            return false;
        return isBalanced(root.left)&&isBalanced(root.right);
    }
    public int MaxDepth(TreeNode root)
    {
        if(root == null)
            return 0;
        return Math.max(MaxDepth(root.left),MaxDepth(root.right))+1;
    }
}