LeetCode - 110. 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.

Example

Example 1:
Given the following tree [3,9,20,null,null,15,7]:

3
/ \
9 20
/ \
15 7
Return true.

Example 2:
Given the following tree [1,2,2,3,3,null,null,4,4]:

1
/ \
2 2
/ \
3 3
/ \
4 4
Return false.

Code

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public boolean isBalanced(TreeNode root) {
        //二叉平衡树 左右子树的高度差小于等于1
        if(root == null) {
            return true;
        }
        int left = depth(root.left);
        int right = depth(root.right);
        return Math.abs(left-right) <=1 && isBalanced(root.left) && isBalanced(root.right); 
    }

    //计算树的高度
    public int depth(TreeNode root){
        if(root == null) {
            return 0;
        }
        return Math.max(depth(root.left),depth(root.right))+1;
    }
}