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.

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.

思路：用res来记录整体变量，然后dfs返回当前的maxdepth，如果左右相差>1, res变成false;

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public boolean isBalanced(TreeNode root) {
        boolean[] res = new boolean[] {true};
        dfs(root, res);
        return res[0];
    }
    
    private int dfs(TreeNode root, boolean[] res) {
        if(root == null) {
            return 0;
        }
        int leftdepth = dfs(root.left, res);
        int rightdepth = dfs(root.right, res);
        if(Math.abs(leftdepth - rightdepth) > 1) {
            res[0] = false;
        }
        return Math.max(leftdepth, rightdepth) + 1;
    }
}