Balanced Binary Tree

Description:

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.

问题描述：

判断一颗树是否为平衡二叉树，平衡二叉树的条件为任意一个结点的左右子树的高度差不超过1。

解法一：

思路：

题目要解决的问题是不是为平衡树，可是需要从高度入手解决问题，所以要构造辅助方法

public int height(TreeNode node)

求树的高度和之前求树的最大深度类似，不过由于是判断平衡树问题，所以让-1作为信号量，该信号指明不为平衡树。期间也需要加入判断两颗子树的高度差操作。

Code:

/**
 * 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;

       return height(root) != -1;
    }
    public int height(TreeNode node){
        if(node == null) return 0;
        int lH = height(node.left);

        if(lH == -1){
            return -1;
        }

        int rH = height(node.right);

        if(rH == -1){
            return -1;
        }

        if(Math.abs(lH - rH) > 1){
            return -1;
        }

        return Math.max(lH,rH) + 1;
    }
}