Problem Balanced Binary Tree

Problem 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.

Solution:

 1     public boolean isBalanced(TreeNode root) {
 2         int[] height = new int[1];
 3         return isBalancedWithHeight(root, height);
 4     }
 5
 6     public boolean isBalancedWithHeight(TreeNode root, int[] height) {
 7 int[] lh = new int[1];
 8         int[] rh = new int[1];
 9         boolean l,r;
10
11         if (root == null) {
12             height[0] = 0;
13             return true;
14         }
15
16         l = isBalancedWithHeight(root.left, lh);
17         r = isBalancedWithHeight(root.right, rh);
18
19         height[0] = ((lh[0] > rh[0])? lh[0] : rh[0]) + 1;
20
21         return (Math.abs(lh[0]-rh[0]) < 2) && l && r;
22     }    

Problem Balanced Binary Tree