CareerCup

To down approach. While visiting a node, check if the node is equal to any of the given input numbers. If yes terminate and return the node. If the node value is in between the given input numbers that is the LCA, return the node and terminate. Otherwise

if node value is less than lower number then recur in the right sub tree.
if node value is greater than the higher input then recur in the left sub tree.

Code below,

public static Node lca(Node n, int x, int y){
        if(n==null)
            return null;
        
        if(n.value == x || n.value == y){
            return n;
        }
        
        if(n.value>x && n.value<y)
            return n;
        
        Node lca = null;
        if(n.value>y){
            lca = lca(n.left, x, y);
        }else{
            lca = lca(n.right, x, y);
        }
        return lca;
        
    }

public static node find( node *root)
{
if( root == null)
return null;
else
if(root->value > first && root->value<second)
return root;
else
if(root->value <first)
find(root->right);
else
if(root->value>right)
find(root->left);
}

Can you write a testing function for this?