Program plan: Declare structure nde with two variables ---- one character txt and other pointers to structure next. Declare class likd_lst with member functions add_nde, gethead, display and concatenate. Define constructor. Declare a pointer to structure variables head and tail. Create the main function. Program description: This program creates two linked-lists of character txt values and concatenates them. Program: #include <iostream> usingnamespace std; structnde//define a new structure { char txt; nde*nxt; };//end of the structure classlikd_lst// Now we declare a class { private: nde*hd,*tl;//declare a pointer for the variables in a structure public: likd_lst()//now we use a constructor { hd=NULL; tl=NULL; }// close of the constructor voidadd_nde(char n)//define an add function to add a nde { nde*tmp=newnde; tmp->txt = n; tmp->nxt=NULL; if(hd==NULL) { hd=tmp; tl=tmp; } else { tl->nxt=tmp; tl=tl->nxt; } }//close of the function nde*gethd()//define a function get head { returnhd; }//close of the function staticvoiddsply(nde*hd)//define a function to display { if(hd==NULL) { std::cout<<"NULL"; } else { std::cout<<hd->txt<<" "; dsply(hd->nxt); } }//close of the function staticvoidconcat(nde*a,nde*b)//define the function for concatenate { if( a!=NULL&& b!=NULL) { if(a->nxt==NULL) a->nxt= b; else concat(a->nxt,b); } else { std::cout<<"Either the a or b of a node is NULL\n"; } }//close of the function };// close of the class intmain(intargc,char&argv)//define the main function with arguments argc and argv { likd_lst a; a.add_nde('A'); a.add_nde('B'); likd_lst b; b.add_nde('P'); b.add_nde('Q'); likd_lst::concat(a.gethd(),b.gethd()); std::cout<<"\n The list of characters of the concatenated linked list is:\t"; likd_lst::dsply(a.gethd()); return0; }//close of the main program Sample output: The concatenated linked list of characters is: A B P Q NULL

C++ How to Program (10th Edition)

10th Edition

ISBN: 9780134448237

Author: Paul J. Deitel, Harvey Deitel

Publisher: PEARSON

See similar textbooks

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 18, Problem 18.14E

Chapter 19, Problem 19.7E

Students have asked these similar questions

Topic: Singly Linked ListImplement the following functions in C++ program. Read the question carefully. Below is the "CODE THAT NEEDS TO BE IMPROVED" or "NOT FINAL CODE" (See attached photo for reference) bool addAt(int num, int pos) This method will add the integer num to the posth position of the list and returns true if the value of pos is valid. Performing addAt(20, 2) in the example list will add 20 at the 2nd position and the linked list will now look like this: 10 -> 20 -> 30 -> 40 -> 50. When the value of pos is invalid i.e. greater than the size + 1 or less than one, return false. bool addAt(int num, int pos) { if (pos == 1) { // case 1: addHead addHead(num); return true; } if (pos == index + 1) { // case 3: addTail addTail(num); return true; } node* currnode = head; //addAt(20, 3) int count = 0; while (currnode…

(Q5) This is a Data Structures problem and the programming language used is Lisp. Solve the question we detailed steps and make it concise and easy to understand. Please and thank you.

C++ PROGRAMMING (Linked list) complete the functions: You have to continue on implementing your Array List namely the following functions: Example ArrayList: [10, 30, 40, 50] void addAt(int num, int pos) This method will add the integer num to the posth position of the list. Performing addAt(20, 2) in the example list will add 20 at the 2nd position and the array will now look like this: [10, 20, 30, 40, 50] When the value of pos is greater than the size + 1 or less than one, output "Position value invalid" void removeAt(int pos) Removes the number in the posth position of the list. Performing removeAt(3) in the example list will remove the 3rd element of the list and the updated array will be: [10, 30, 50] When the value of pos is greater than the size or less than one, output "Position value invalid" My incomplete code: #include <cstdlib>#include <iostream>using namespace std; class ArrayList : public List { // : means "is-a" / extend int* array; int index;…

Knowledge Booster

Want to see more full solutions like this?

Want to see the full answer?

Chapter 19 Solutions