leetCode练习（110）

题目：Balanced Binary Tree          

难度：easy

问题描述：

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.

解题思路：

使用递归，求出每个节点root的左右子树的长度并判断该节点是否为平衡树即可。

代码如下：

/**
 * Definition for a binary tree node.
 * 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 l=height(root.left);
        int r=height(root.right);
        if(l<0||r<0||Math.abs(l-r)>1) return false;
        return true;
    }
    private int height(TreeNode root){
		if(root==null) return 0;
		int l=height(root.left);
		int r=height(root.right);
		if(l<0||r<0||Math.abs(l-r)>1)	return -1;
		return Math.max(l, r)+1;	
	}
}