Find the height of BST

public int findheight(TreeNode root){
if(root==null)
return 0;
if(!root.left&&root.right)
return 1;
else{
return MAX(findheight(root.left)+1, findheight(root.right)+1);
}
}

public int MAX(int a1, int a2){
if(a1>a2)
return a1;
else if(a1<a2)
return a2;
else
return a1;
}