110. Balanced Binary Tree

最新推荐文章于 2019-05-30 16:19:23 发布

原创最新推荐文章于 2019-05-30 16:19:23 发布 · 238 阅读

0 ·

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

leetcode solutions 专栏收录该内容

139 篇文章

订阅专栏

本文介绍了一种用于判断二叉树是否为高度平衡的方法。提供了两种解决方案：一种是通过递归检查每个节点的左右子树深度；另一种是改进版方案，通过一次遍历同时完成深度检查与平衡性验证。

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

Solution 1

2ms 22.81% Recursively check the left depth and right depth of a node, absolutely not the best solution.

public class Solution {
    public boolean isBalanced(TreeNode root) {
        if(root == null){
            return true;
        }
        int left = getDepth(root.left);
        int right = getDepth(root.right);
        if(Math.abs(left - right) > 1){
            return false;
        }
        return isBalanced(root.left) && isBalanced(root.right);
    }
    public int getDepth(TreeNode root){
        if(root == null){
            return 0;
        }
        return Math.max(getDepth(root.left),getDepth(root.right)) + 1;
    }
}

Solution2 Improvement on the solution 1

This method should be faster than the first one but I don't know why it cost more time.

21ms 3.83%

public class Solution {
    public boolean isBalanced(TreeNode root) {
        if(checkDepth(root) == -1){
            return false;
        }
        return true;
    }
    public int checkDepth(TreeNode root){
        if(root == null){
            return 0;
        }
        int left = checkDepth(root.left);
        if(left == -1){
            return -1;
        }
        int right = checkDepth(root.right);
        if(right == -1){
            return -1;
        }
        if(Math.abs(left - right) > 1){
            return -1;
        }
        return Math.max(checkDepth(root.left), checkDepth(root.right)) + 1;
    }
}