Java recursive implementation of balanced binary tree

public class Balanced binary tree
{
public class TreeNode
{
TreeNode left;
TreeNode right;
int Val;

TreeNode (int x)
{
This.val = x;
}
}

Get depth
private int getdepth (TreeNode tree, int currentdepth)
{
if (tree = = null)
{
return currentdepth;
}
Return Math.max (Getdepth (tree.left, currentdepth + 1),
Getdepth (Tree.right, currentdepth + 1));

}

Using Recursive solutions
public Boolean isbalanced (TreeNode root)
{
if (root = = null)
{
return true;
}
int depthofleft = Getdepth (root.left, 1);
int depthofright = Getdepth (root.right, 1);
if (Math.Abs (depthofleft-depthofright) > 1)
{
return false;
}
Else
{
Return isbalanced (Root.left) && isbalanced (root.right);
}
}
}

Java recursive implementation of balanced binary tree