Program Plan: The program includes the standard headers that are required for the program. Here we define a class lnklst and member functions appd , disp and mrg. Define a constructor that is used to initialize the values. Define one destrucutor which is used to destruct the constructor after termination of the program. Declare structure nd with dt members integer type dt , nd *nxt and structure a variable *strt. Initialize the driver function main () . Program description: This program is intended to merge two lnked lists which are sorted already into a single another lnked list in a sorted order. Program: #include<iostream>// declare a header file of standard input and output using namespace std;//include the namespace class lnklst{//define the class lnklst private: struct nd{// define a new structure node int dt;// declare the variables data nd* lnk; }*strt;// end of the structure by declaring the pointer variable public: lnklst(){//Initialization of the constructor strt=NULL; }// end of the constructor void appd(int);//declare the member functions void disp(); void mrg(lnklst, lnklst,lnklst&); // function to merge the linked list ~lnklst()//define the destructor { nd *q; while(strt!=NULL) { q=strt->lnk; delete strt; strt=q; } }//close of the destructor };// closing the class void lnklst::appd(int num){//define the append function nd *tmp, *r; tmp=strt; if(strt==NULL) { tmp=new nd; tmp->dt=num; tmp->lnk=NULL; strt=tmp; } else { while(tmp->lnk!=NULL) { tmp=tmp->lnk; } r= new nd; r->dt=num; r->lnk=NULL; tmp->lnk=r; } }//closing of the append function void lnklst::disp() {//define the display function nd *tmp; tmp=strt; cout<<"Lnked List is"<<endl; while(tmp!=NULL) { cout<<tmp->dt<<" "; tmp=tmp->lnk; } cout<<endl; }//closing of the display function void lnklst::mrg(lnklst l1, lnklst l2,lnklst& l3) //define the merge function { nd *p, *q; p=l1.strt; q=l2.strt; int dat; while(p!=NULL && q!=NULL) { if(p->dt > q->dt) { dat=q->dt; l3.appd(dat); q=q->lnk; } // end of If else { dat=p->dt; l3.appd(dat); p=p->lnk; }//end of else }//end of while if(p==NULL) { while(q!=NULL) { dat=q->dt; l3.appd(dat); q=q->lnk; } }// end of if else { while(p!=NULL) { dat=p->dt; l3.appd(dat); p=p->lnk; }//end of while }// end of else cout<<"lists mrgd"<<endl; }//closing of the merge function int main() // begin of the main function { lnklst l1,l2,l3; l1.appd(1); l1.appd(2); l1.appd(33); l1.appd(36); l1.appd(54); l1.disp(); l2.appd(3); l2.appd(12); l2.appd(39); l2.appd(66); l2.disp(); l3.mrg(l1, l2,l3); l3.disp(); return 0; }// end of main Sample output: Lnked list is 1 2 33 36 54 Lnked list is 3 12 39 66 lists mrg 1 2 3 12 33 36 39 54 66

10th Edition

ISBN: 9780134448237

Author: Paul J. Deitel, Harvey Deitel

Publisher: PEARSON

Expert Solution & Answer

Students have asked these similar questions

How can I perform Laplace Transformation when using integration based on this? Where we convert time-based domain to frequency domain

what would be the best way I can explain the bevhoirs of Laplace and Inverse Transofrmation In MATLAB.

What IETF protocol is NetFlow associated with? Group of answer choices IPX/SPX IPIX HTTPS SSH

Knowledge Booster

Similar questions

SEE MORE QUESTIONS

Recommended textbooks for you