Binary Search Tree : Lowest Common Ancestor

1.  /* Node is defined as :
2.  class Node 
3.     int data;
4.     Node left;
5.     Node right;
6.     
7.     */
8. 
   
9. static Node lca(Node root,int v1,int v2)
10.     {
11. 
    
12.        //Decide if you have to call rekursively
13.     //Samller than both
14.     if(root.data < v1 && root.data < v2){
15.         return lca(root.right,v1,v2);
16.     }
17.     //Bigger than both
18.     if(root.data > v1 && root.data > v2){
19.         return lca(root.left,v1,v2);
20.     }
21. 
    
22.     //Else solution already found
23.     return root;
24.     }