Leetcode: Balanced Binary Tree_leetcode

Given a binary tree, determine if it is height-balanced.

For this problem, a height-balanced binary's defined as a binary tree in which the depth of two of subtrees Y node never differ by more than 1.

To determine whether the left and right subtree height difference is greater than 1

Solve the idea: ...

Code:

public class Solution {public
    Boolean isbalanced (TreeNode root) {
        if (root = null) {return
            true;
        }

        if (math.abs depth (root.left)-depth (root.right)) > 1) {return
            false;
        }

        Return isbalanced (Root.left) && isbalanced (root.right);
    }

    private int Depth (TreeNode root) {
        if (root = null) {return
            0;
        }

        return Math.max (Depth (root.left), Depth (root.right)) + 1
    }
}