Tree——No.110 Balanced Binary Tree

No.110 Balanced Binary Tree

Problem：

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.

Explanation：

判断一棵树是否是平衡树。

My Thinking：

对每个结点的子树计算其深度，判断是否差1即可。

My Solution：

class Solution {
    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);
    }
    public int depth(TreeNode root){
        if(root==null)
            return 0;
       return Math.max(depth(root.left)+1,depth(root.right)+1);
    }
}

Optimum Thinking:

从下到上检查每个结点的子树深度之差。

Optimum Solution：

class Solution {
    public boolean isBalanced(TreeNode root) {
       if(checkDepth(root)==-1)
           return false;
        else
            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;
        int diff = Math.abs(left - right);
        if (diff > 1) 
            return -1;
        else 
            return 1 + Math.max(left, right);
    }
}