Leetcode 110. Balanced Binary Tree

最新推荐文章于 2024-05-20 07:37:39 发布

原创最新推荐文章于 2024-05-20 07:37:39 发布 · 291 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

Leetcode

当前文章被收录于：

Leetcode

15 篇文章 0 人学习

订阅专栏查看详情

当前文章被以下社区和专栏收录：

本文介绍了一种用于判断二叉树是否为高度平衡的方法。高度平衡二叉树定义为对于树中每一个节点，其两个子树的深度相差不超过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.

public class Solution {
    public boolean isBalanced(TreeNode root) {
        if(root == null) return true;
        int left = getDepth(root.left);
        int right = getDepth(root.right);
        boolean isBalance = Math.abs(left-right)>1?false:true;
        return isBalance&&isBalanced(root.left)&&isBalanced(root.right);
    }
    private int getDepth(TreeNode root){
        if(root == null) return 0;
        //if(root.left==null&&root.right==null) return 1;
        int depth = 1;
        int leftDepth = getDepth(root.left)+1;
        int rightDepth = getDepth(root.right)+1;
        return leftDepth>rightDepth?leftDepth:rightDepth;
    }
}