LeetCode 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; }
 * }
 */
class Solution {
     private int maxDepth(TreeNode root) {
        /**
         * 求树的高度
         * 把大问题分解成小问题，树的高度是从字树的高度得到的
         */
        if (root == null) {
            return 0;
        } else {
            return Math.max(1 + maxDepth(root.left), 1 + maxDepth(root.right));
        }

    }
    
    public boolean isBalanced(TreeNode root) {
        /**
         * 按照平衡二叉树的定义：平衡二叉树为左子树和右子树高度之差不超过1
         * 按照定义解答如下
         * 求高度函数，解答见之前的博客
         */
        //为空直接返回真
        if (root == null) {
            return true;
        }
        
        //求左子树的高度
        int left = maxDepth(root.left);
        //右子树的高度
        int right = maxDepth(root.right);
        //递归判断左右子树
        return Math.abs(left - right) <= 1 && isBalanced(root.left) && isBalanced(root.right);
    }
}