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.

public class Solution {
    public boolean isBalanced(TreeNode root) {
        return diff(root) != -1;
    }
    private int diff(TreeNode root)
    {
        if(root == null)
        {
            return 0;
        }
        int left = diff(root.left);
        int right = diff(root.right);
        if(left == -1 || right == -1 ||Math.abs(left-right) > 1)
        {
            return -1;
        }
        return Math.max(left,right) + 1;
    }
}