(LEETCODE)Lowest_Common_Ancestor_BST.cpp

// Below is the function for lowest common ancestor of a bst 
Node* LCA(Node *root, int n1, int n2)
{
   if(root->data>n1 && root->data>n2){
      return LCA(root->left, n1, n2);
   }
   else if(root->data<n1 && root->data<n2){
       return LCA(root->right, n1, n2);
   }
   else{
       return root;
   }
}