Leetcode: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; }
 * }
 */
public class Solution {
    public boolean isBalanced(TreeNode root) {
        if(root == null){
            return true;
        }
        int l = deep(root.left);
        int r = deep(root.right);
        if((l-r) < -1 || (l-r) > 1 ){    //check if root is banlanced
            return false;
        }
        return isBalanced(root.left) && isBalanced(root.right);   //check root.left and root.right is banlanced
    }
    
    public int deep(TreeNode root){            //get the depth of root
        if(root == null){
            return 0;
        }
        int l = deep(root.left);
        int r = deep(root.right);
        if(l > r){
            return l + 1;
        }else{
            return r + 1;
        }
    }
}

方法感觉比较笨，本来以为会超时，没想到居然Accepted。先递归求出深度，然后递归判断每个节点是否平衡。