110. 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 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 heightDiffer = countDepth(root.left) - countDepth(root.right);
        if(heightDiffer > 1 || heightDiffer < -1){
            return false;
        }else{
            return isBalanced(root.left)&&isBalanced(root.right);
        }        
    }
    
    //计算树的高度
    public int countDepth(TreeNode root){
        if(root == null){return 0;}
        
        int left = countDepth(root.left); 
        int right = countDepth(root.right);
        
        if(left <= right){
            return right+1;
        }else{
            return left+1;
        }
    }  
}

【注】

上述代码是自顶向下的写法，在看discuss的时候看到另一种从底向上的算法，那种方法不用两个函数都在递归，能够降低时间复杂度。