Balanced Binary Tree - Leetcode

/**
 * 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) {
        return isBalancedHelper(root)>=0;
    }
    
    private int isBalancedHelper(TreeNode root){
        if(root == null)
           return 0;
           
        int left = isBalancedHelper(root.left);
        int right = isBalancedHelper(root.right);   
        if(left < 0 || right < 0 || Math.abs(left-right)>1)
          return -1;
          
        return Math.max(left,right)+1;  
        
    }
}

思路：先走到最左下面，然后走到最右边，从最右边回退，一边回退一边标识有效高度。

如果只有一个节点，就是 math.max(0,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.