Question

1. Write a function to implement linked list consisting of six nodes. Store the data in the nodes in the order given below. Also, write a function to display the data stored in the implemented linked list. in C++ programming

use these as names as nodes George, Paul, Ross, Joe, Elaine, Robert1.

2. Insert three nodes in between second node and third node in the linked list that you implemented in problem 1. Store the following data in the new (inserted) nodes in the following order. (You have to write a function for insertion operation. in C++ programming)

use these three nodes to insert Davis1, Davis2, Davis3

Answer 1

--------------------------------------------------------------------------------------------------------------------------------

#include<iostream>
#include<malloc.h>
#include<string.h>
using namespace std;
struct node//structure for representing linked list node
{
   char a[10];
   struct node *next;
};
struct node *insert(struct node *first)//inserting function
{
   struct node *n,*n1,*n2,*n3,*n4,*n5;
   first=(struct node *)malloc(sizeof(struct node));//allocating space
   strcpy(first->a,"George");//storing data in node
   n1=(struct node *)malloc(sizeof(struct node));
   first->next=n1;
   strcpy(n1->a,"Paul");
   n2=(struct node *)malloc(sizeof(struct node));
   n1->next=n2;
   strcpy(n2->a,"Ross");
   n3=(struct node *)malloc(sizeof(struct node));
   n2->next=n3;
   strcpy(n3->a,"Joe");
   n4=(struct node *)malloc(sizeof(struct node));
   n3->next=n4;
   strcpy(n4->a,"Elaine");
   n5=(struct node *)malloc(sizeof(struct node));
   n4->next=n5;
   strcpy(n5->a,"Robert1");
   n5->next=NULL;
   return first;
}
struct node *insert1(struct node *first)//inserting function
{
   struct node *n,*n1,*n2,*n3,*n4;
   n=first->next;
   n1=first->next->next;
   n2=(struct node *)malloc(sizeof(struct node));
   n->next=n2;
   strcpy(n2->a,"Davis1");
   n3=(struct node *)malloc(sizeof(struct node));
   n2->next=n3;
   strcpy(n3->a,"Davis2");
   n4=(struct node *)malloc(sizeof(struct node));
   n3->next=n4;
   strcpy(n4->a,"Davis3");
   n4->next=n1;
   return first;
}

void show(struct node * first)//function to show the data
{
   struct node *temp=first;
   while (temp!=NULL)//traversing entire linkedlist
   {
       cout<<temp->a<<"\n";//printing data present in every node.
       temp=temp->next;
   }
   cout<<"\n";
}

int main()
{
   int n;
   struct node *first=NULL,*temp;
   int i=0;
   first=insert(first);//calling insertion function.
   cout<<"----------------first inserted nodes-------------------------\n";
   show(first);//displaying data.
   first=insert1(first);//calling insertion function.
   cout<<"----------------after inserting 3 more nodes nodes-------------------------\n";
   show(first);//displaying data.
   return 0;
}

--------------------------------------------------------------------------------------------------------------------------------