Intersection of two sorted Linked lists.cpp

/*
Intersection of two sorted Linked lists
============================================

Given two lists sorted in increasing order, create a new list representing the intersection of the two lists. The new list should be made with its own memory — the original lists should not be changed.

Example 1:
Input:
L1 = 1->2->3->4->6
L2 = 2->4->6->8
Output: 2 4 6
Explanation: For the given first two
linked list, 2, 4 and 6 are the elements
in the intersection.

Example 2:
Input:
L1 = 10->20->40->50
L2 = 15->40
Output: 40
Your Task:
The task is to complete the function intersection() which should find the intersection of two linked list and add all the elements in intersection to the third linked list and return the head of the third linked list.

Expected Time Complexity : O(n+m)
Expected Auxilliary Space : O(n+m)
Note: n,m are the size of the linked lists.

Constraints:
1 <= size of linked lists <= 5000
1 <= Data in linked list nodes <= 1000
*/

Node *findIntersection(Node *head1, Node *head2)
{
  auto curr1 = head1, curr2 = head2;
  Node *newHead = new Node(-1);
  auto temp = newHead;

  while (curr1 && curr2)
  {
    if (curr1->data == curr2->data)
    {
      Node *newNode = new Node(curr1->data);
      temp->next = newNode;
      temp = temp->next;
      curr1 = curr1->next;
      curr2 = curr2->next;
    }
    else if (curr1->data < curr2->data)
      curr1 = curr1->next;
    else
      curr2 = curr2->next;
  }

  return newHead->next;
}