Intersection of Two Linked Lists

#1

question–>
https://practice.geeksforgeeks.org/problems/intersection-of-two-linked-list/1/?category[]=Linked%20List&category[]=Linked%20List&problemStatus=unsolved&page=1&query=category[]Linked%20ListproblemStatusunsolvedpage1category[]Linked%20List#
code–>

Node* findIntersection(Node* head1, Node* head2)
{   Node* dummy=new Node(0);
   Node* p=dummy;
   Node* temp1=head1;
   Node* temp2=head2;
   while(temp1!=NULL){
       while(temp2!=NULL){
           if(temp2->data==temp1->data){
               p->next=new Node(temp1->data);
               p=p->next;
           }
           temp2=temp2->next;
       }
       temp1=temp1->next;
   }
    return dummy->next;
}

The code is showing any output help

#2

@aa1 are you there? ?

#3

see the implementation here:

#4

it is not that question,it says to find the intersection of ll not the the intersection point

#5

yeah, my bad, ive updated the link now , please check