Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree was defined as a binary tree in which the depth of the subtrees of the Y node never Diffe

classTreeNode {intVal;     TreeNode left;     TreeNode right; TreeNode (intX) {val =x;} } Public classSolution { Public Booleanisbalanced (TreeNode root) {if(root==NULL)return true; intleft=treedepth (Root.left); intright=treedepth (root.right); if(Math.Abs (left-right) <=1) {//Conditionif(isbalanced (Root.left) &&isbalanced (Root.right))//Recursive call isbanlianced (root); return true; }        return false; }    Private inttreedepth (TreeNode root) {//To find the depth of the tree//TODO auto-generated Method Stub        if(root==NULL)return0; returnMath.max (Treedepth (root.right), treedepth (root.left)) +1; }}

Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree was defined as a binary tree in which the depth of the subtrees of the Y node never Diffe