Создать список из элементов, которые входят одновременно в оба списка

#include <iostream>
 
using namespace std;
 
struct Node
{
int data;
Node* next;
};
 
typedef Node* PNode;
 
void show(PNode& Head)
{
PNode curr = Head;
while (curr != NULL)
{
cout << curr->data << " ";
curr = curr->next;
}
}
 
void mergeLists(PNode& Head1, PNode& Head2, PNode& Head3)
{
PNode curr1 = Head1;
PNode curr2 = Head2;
while (curr1 != NULL && curr2 != NULL)
{
if (curr1->data == curr2->data)
{
if (Head3 == NULL)
{
Head3 = new Node;
Head3->data = curr1->data;
Head3->next = NULL;
}
else
{
PNode temp = Head3;
while (temp->next != NULL)
{
temp = temp->next;
}
temp->next = new Node;
temp->next->data = curr1->data;
temp->next->next = NULL;
}
curr1 = curr1->next;
curr2 = curr2->next;
}
 
 
}
}
 
 
int main()
{
setlocale(LC_ALL, "Russian");
PNode Head1 = NULL;
PNode curr1 = Head1;
int n;
cout << "Введите список 1 : " << endl;
cin >> n;
while (n != 0)
{
if (!Head1)
{
Head1 = new Node;
Head1->data = n;
Head1->next = NULL;
curr1 = Head1;
}
else
{
curr1->next = new Node;
curr1 = curr1->next;
curr1->data = n;
curr1->next = NULL;
}
cin >> n;
}
curr1 = Head1;
 
PNode Head2 = NULL;
PNode curr2 = Head2;
int n2;
cout << "Введите список 2 : " << endl;
cin >> n2;
while (n2 != 0)
{
if (!Head2)
{
Head2 = new Node;
Head2->data = n2;
Head2->next = NULL;
curr2 = Head2;
}
else
{
curr2->next = new Node;
curr2 = curr2->next;
curr2->data = n2;
curr2->next = NULL;
}
cin >> n2;
}
curr2 = Head2;
 
PNode Head3 = NULL;
mergeLists(Head1, Head2, Head3);
 
cout << "Spisok 1" << endl;
show(Head1);
cout << endl;
cout << "Spisok 2" << endl;
show(Head2);
cout << endl;
cout << "spisok itog" << endl;        
show(Head3);
return 0;
}