Chapter 8, Problem 11CRP

Explanation of Solution

The function for concatenating two linked lists:

The function to concatenate two linked is dined as below.

//Define method concatenate

static void concatenate(node *a, node *b)

{

//If condition satisfies

if( a != NULL && b!= NULL )

{

//If condition satisfies

if (a->nxt == NULL)

//Assign value

a->nxt = b;

//If condition satisfies

else

//Call method

concatenate(a->nxt,b);

}

//If condition satisfies

else

{

//Display message

cout << "Either a or b is NULL\n";

}

}

Explanation:

• The function “concatenate()” concatenates values in two linked lists.
• It checks initially whether two linked lists are empty or not.
• If both linked lists are non-empty, it proceeds with checking the end of first linked list.
• Assign second linked list to the end of first linked list.
• The result is been displayed finally.

Complete Program:

//Include library

#include <iostream>

//Use namespace

using namespace std;

//Define structure

struct node

{

//Declare variable

int dta;

//Declare pointer

node *nxt;

};

//Define class

class lnkdLst

{

//Define access specifier

private:

//Define nodes

node *head,*tail;

//Define access specifier

public:

//Define constructor

lnkdLst()

{

//Assign value

head = NULL;

//Assign value

tail = NULL;

}

//Define method

void AdNode(int n)

{

//Assign value

node *tmp = new node;

//Assign value

tmp->dta = n;

//Assign value

tmp->nxt = NULL;

//If condition satisfies

if(head == NULL)

{

//Assign value

head = tmp;

//Assign value

tail = tmp;

}

//If condition satisfies

else

{

//Assign value

...