[leet code] 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.

===========

Analysis:

So sad today.. broke up with my girl friend this morning (13 hours time differences).  But life must go on, leetcode must go on......

Original thought is that use recursive method to determine if the tree is balanced, then the left sub-tree, and right sub-tree.  The condition of which is that the depth difference between left sub-tree and right sub-tree is no more then 1.  

Then the second problem is to calculate the depth of a tree, which can also use recursive approach.  But I didn't figure it out due to I was not very familiar with how to pass parameter between recursive calls as well as I was so sad that I could not think out it peacefully... I finally referred to the solution available in Internet and worked out my own version:

/**
 * Definition for binary tree
 * 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 ld = treeDepth(root.left);
        int rd = treeDepth(root.right);
        
        if(ld-rd>1 || rd-ld>1) return false;
        return isBalanced(root.left) && isBalanced(root.right);
    }
    
    public int treeDepth(TreeNode node){
        if(node == null) return 0;
        
        int leftDepth = treeDepth(node.left);
        int rightDepth = treeDepth(node.right);
        
        return leftDepth>rightDepth? leftDepth+1:rightDepth+1;
    }
}