lca.java

class GfG
{   
    Node lca(Node node, int n1, int n2) 
    {
        Node root = node;
        while(root != null){
            if(root.data>n1 && root.data >n2)
            {
                root = root.left;
            }
            else if(root.data < n1 && root.data <n2){
                root = root.right;
            }
            else{
                return root;
            }
        }
        return null;
        
    }
    
}