110. Balanced Binary Tree （平衡二叉树判断）

最新推荐文章于 2024-11-01 15:19:21 发布

Alan_Xiang

最新推荐文章于 2024-11-01 15:19:21 发布

阅读量570

点赞数

分类专栏： leetcode LeetCode Solutions In Java 文章标签： leetcode 算法二叉树

本文链接：https://blog.csdn.net/xiangwanpeng/article/details/52950589

版权

leetcode 同时被 2 个专栏收录

122 篇文章 0 订阅

订阅专栏

LeetCode Solutions In Java

122 篇文章 7 订阅

订阅专栏

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 a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    
    public int depth(TreeNode root){
        if(root==null)
        return 0;
        return Math.max(depth(root.left),depth(root.right))+1;
    }
    public boolean isBalanced(TreeNode root) {
        if(root==null)
        return true;
        if(Math.abs(depth(root.left)-depth(root.right))>1)
        return false;
        return isBalanced(root.left)&&isBalanced(root.right);
    }
}