Question

You need to complete a function called insertList. Given list A, list B and an integer n, insertList inserts list B into the middle of list A, after the list value n.
NOTE: 1) All positions and indices start from 0.

2) Write your code in the empty function of insertList, DO NOT change anything in the main.

Example

Assume we are starting with two lists:
List A is:
2->3->9->11
List B is:
5->6->8
Insert after node value: 3
Resulting list A is:
2->3->5->6->8->9->11

CODE BELOW

#include <iostream>
using namespace std;

// The node structure to be used in the linked list
struct Node {
int data;
Node *pNext;
};

/*
* insertList function
* 1) Given list A, list B and an integer n, insertList inserts
* list B into the middle of list A, after the list value n.
* 2) Assume list A and B are not empty.
* 3) Assume n is contained exactly once in list A.
* parameter(s):
* pHeadA: the head of list A.
* pHeadB: the head of list B.
* n: the node value to insert after.
* return: None
*/
void insertList( Node *pHeadA, Node *pHeadB, int n)
{
// insert your code here
}

//---------------------------------------
// You do not need to change anything below this line
// However, you will need to read it to understand how the Linked List
// is pushing data elements to the list.
//---------------------------------------
void display(Node *pHead){
while( pHead != NULL) {
cout << pHead->data << " ";
pHead = pHead->pNext;
}
cout << endl;
}

void buildList(Node *&pHead){
Node *pTemp;
int userInput;
cin >> userInput;  
// Keep looping until end of input flag of -1 is given
while( userInput != -1) {
// Store this number on the list
pTemp = new Node;
pTemp->data = userInput;
pTemp->pNext = pHead;
pHead = pTemp;
cin >> userInput;
}
}

int main()
{
// Build list A and list B
Node *pHeadA = NULL, *pHeadB = NULL;
cout<<"Enter numbers for list A: (separate by space, enter -1 to indicate end of list)" <<endl;
buildList(pHeadA);
cout<<"Enter numbers for list B: (separate by space, enter -1 to indicate end of list)" <<endl;
buildList(pHeadB);

// Display list A and list B
cout << "We are starting with two lists: " << endl;
cout << "List A is: " << endl;
display(pHeadA);
cout << "List B is: " << endl;
display(pHeadB);

// Get the node value to insert after
int insertValue;
cout << "Insert after node value: " << endl;
cin >> insertValue;
  
// insert listB into the middle of listA, after the designated node value.
insertList( pHeadA, pHeadB, insertValue);
  
// Display the resulting list
cout << "Resulting list A is: " << endl;
display(pHeadA);

return 0;
}