Leetcode 110. Balanced Binary Tree

Question

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.

Code

 public int get(TreeNode root) {
        if (root == null) {
            return 0;
        }
        int ldep = get(root.left);
        if (ldep == -1) {
            return -1;
        }
        int rdep = get(root.right);
        if (rdep == -1) {
            return -1;
        }
        if (Math.abs(ldep - rdep) >= 2) {
            return -1;
        }
        return Math.max(rdep + 1, ldep + 1);

    }

    public boolean isBalanced(TreeNode root) {

        int result = get(root);
        return result != -1;
    }