𝐋𝐨𝐰𝐞𝐬𝐭 𝐂𝐨𝐦𝐦𝐨𝐧 𝐀𝐧𝐜𝐞𝐬𝐭𝐨𝐫 𝐢𝐧 𝐚 𝐁𝐢𝐧𝐚𝐫𝐲 𝐓𝐫𝐞𝐞.cpp

 Node* lca(Node* root ,int n1 ,int n2 )
    {
       //Your code here
        if(root==NULL){
          return root;
      }
      if(root->data==n1 || root->data==n2){
          return root;
          
      }
      Node* lca1=lca(root->left,n1,n2);
      Node* lca2=lca(root->right,n1,n2);
      if(lca1!=NULL && lca2!=NULL){
          return root;
      }
      if(lca1!=NULL){
          return lca1;
       }
       else{
           return lca2;
       }
    }