Balanced Binary Tree

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 binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {


    public boolean isBalanced(TreeNode root) {
        if(root==null)
        return true;
        
        int diff=Math.abs(Depth(root.left)-Depth(root.right));
        if(diff>1)
        return false;
        
        return isBalanced(root.left)&&isBalanced(root.right);
    }
    public int Depth(TreeNode root){
     
    	if(root==null)
    		return 0;
    	else
    	    {int l=Depth(root.left)+1;
            int r=Depth(root.right)+1;
            
            return l>r?l:r;
            
    		}
}
    
}