Question

Can you make simple code of this using C++

In-lab Final Exam Ideas: Following are the possible topics for the in-lab final exam for next week. These all assume that we have: struct Node int data; Node 'pNext; and in main we have: Node "pHead = NULL; // pointer to the head of the list Node·pTemp: // Used to get new nodes Node "pHeadA NULL: Node "pHeadB = NULL; We will also provide for you the code that is used to create the list and the code to traverse and display the list elements. You can also assume that lists being processed already exist, and that the pointers for new lists are initialized to NULL. For the examples below, unless specified otherwise assume the list we are starting with is the list: Sum lists: Given list A and list B of the same length, traverse them to create a new list, where the first new node on A plus the first node on B, the second new list node contains the sum of the second node on A plus the second node on B, 1. and so on. Assume list A and list B contain the following pListA is: 1->3->4-7 pListB is: 2->4->6->10 Calling combineLists/...from within main would look like the following: combineLists( Node "&pHead, Node pListA, Node "pListB) displayList( pHead); and it would result in the following output 3->7-10->17

Answer 1

//C++ program

#include<iostream>
using namespace std;

struct node{
   int data;
   struct node*next;
};

struct node* addNode(struct node*list,int data){
   struct node*newnode = new(struct node);
   newnode->data = data;
   newnode->next=NULL;
  
   if(!list)return newnode;
  
   struct node*current = list;
   while(current->next)current=current->next;
  
   current->next = newnode;
   return list;
}

void print(struct node*list){
   while(list){
       cout<<list->data<<" ";
       list=list->next;
   }
   cout<<"\n";
}

void combineLists(node*&pHead,node*pHeadA,node*pHeadB){
   while(pHeadA&&pHeadB){
       pHead = addNode(pHead,pHeadA->data+pHeadB->data);
       pHeadA = pHeadA->next;
       pHeadB = pHeadB->next;
   }
   while(pHeadA){
       pHead = addNode(pHead,pHeadA->data);
       pHeadA = pHeadA->next;
   }
   while(pHeadB){
       pHead = addNode(pHead,pHeadB->data);
       pHeadB = pHeadB->next;
   }
}

int main(){
   node* pHead = NULL;
   node* pHeadA = NULL;
   node* pHeadB = NULL;
  
   pHead = addNode(pHead,2);
   pHead = addNode(pHead,3);
   pHead = addNode(pHead,5);
   pHead = addNode(pHead,6);
   pHead = addNode(pHead,8);
   pHead = addNode(pHead,9);
   pHead = addNode(pHead,11);
   cout<<"List is : \n";
   print(pHead);
  
   pHeadA = addNode(pHeadA,1);
   pHeadA = addNode(pHeadA,3);
   pHeadA = addNode(pHeadA,4);
   pHeadA = addNode(pHeadA,7);
   cout<<"\nList A is : \n";
   print(pHeadA);
  
   pHeadB = addNode(pHeadB,2);
   pHeadB = addNode(pHeadB,4);
   pHeadB = addNode(pHeadB,6);
   pHeadB = addNode(pHeadB,10);
   cout<<"\nList B is : \n";
   print(pHeadB);
  
   pHead = NULL;
   combineLists(pHead,pHeadA,pHeadB);
   cout<<"\nCombine List is : \n";
   print(pHead);
   return 0;
}

//sample output

CAUsers IshuManish\Documentsl combinelisy.exe List is : 2 3 5 6 89 11 List A is 1 3 4 7 List B is: 2 4 6 10 Combine List is 3 7 10 17 Process exited after 0.09939 seconds with return value 0 Press any key to continue . .