110. Balanced Binary Tree

判断二叉树是否平衡

最新推荐文章于 2022-07-18 20:53:17 发布

weixin_30376323

最新推荐文章于 2022-07-18 20:53:17 发布

阅读量47

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/ycled/p/3334153.html

本文介绍了一种算法，用于判断一棵二叉树是否为高度平衡的二叉树。高度平衡二叉树定义为对于每一个节点，其左右子树的深度之差不超过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 ofevery 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) {
        
        int rst = helper(root);
        return rst != -1;
        
    }
    
    private int helper(TreeNode node){
        
        if(node == null)    return 0;
        
        int left = helper(node.left);
        if(left == -1)  return -1;
        
        int right = helper(node.right);
        if(right == -1) return -1;
        
        int diff = Math.abs(left-right);
        if(diff > 1)
            return -1;
        else
            return Math.max(left, right) + 1;
        
    }
}