Binary Search Trees:LCA of BST

public class Solution {

    /*	Binary Tree Node class
 * 
 * class BinaryTreeNode<T> {
		T data;
		BinaryTreeNode<T> left;
		BinaryTreeNode<T> right;

		public BinaryTreeNode(T data) {
			this.data = data;
		}
	}
	*/

    public static int lcaInBST(BinaryTreeNode<Integer> root , int a , int b){
        // Write your code here
        
        if(root==null)
            return -1;
        int c=-1;
        if(root.data==a || root.data==b)
            return root.data;
      
       else if(a<root.data && b>root.data || a>root.data && b<root.data)
        {
             c=lcaInBST(root.left,a,b);
            int d=lcaInBST(root.right,a,b);
            if(c==-1 && d==-1)
                return -1;
            else if(c==-1 && d!=-1)
                return  d;
            else if(c!=-1 && d==-1)
                return c;
            else
                return root.data;
        }
        
         else if(a<root.data &&b<root.data)
        {
             c=lcaInBST(root.left,a,b);
        }
       else if(a>root.data &&b>root.data)
        {
             c=lcaInBST(root.right,a,b);
        }
    
        if(c!=-1)
            return c;
         else
            return -1;


    }
}