Question

Would you please help me to do this problem?

this is c programming.

1. write figures of inserting 3 elements into a stack linked list and a queue linked list with code fragments and then delete 2 elements from each with associated code fragments.

thank you.

Answer 1

Inserting three elements into stack using linked list

Insert 10,20,30

Initially top=NULL

Suppose Node consists of two parts

1. data

2. address of next node

Node representation=(data,address)

Insert 10

(10,NULL)

100(address of newly created node)(top points to 100)

Insert 20

(20,100)--------->(10,NULL)

200------------------>100

top

Insert 30

(30,200)----->(20,100)-----> (10,NULL)

300------------> 200-----------> 100

top

(now top is at 300)

Code for inserting elements into stack using linked list

struct Node* insert(int element)
{
struct Node* newnode;
newnode=(struct Node*)malloc(sizeof(struct Node*));
newnode->data=element;
if(top==NULL)
{
top=newnode;
}
else
{
newnode->next=top;
top=newnode;
}
return top;
}

Inserting three elements into queue using linked list

Insert 10,20,30

Initially front=NULL,rear=NULL

Suppose Node consists of two parts

1. data

2. address of next node

Node representation=(data,address)

Insert 10

(10,NULL)

100(address of newly created node)(front,rear points to 100)

Insert 20

(10,200)------------>(20,NULL)

100--------------------->200

front--------------------- rear

Insert 30

(10,200)------------>(20,300)------>(30,NULL)

100-------------------> 200--------------> 300

front----------------------------------------- rear

Code for inserting elements into queue using linked list

struct Node* insert(int element)
{
struct Node* newnode;
newnode=(struct Node*)malloc(sizeof(struct Node*));
newnode->data=element;
if(front==NULL)
{
front=newnode;
rear=newnode;
}
else
{
rear->next=newnode;
rear=newnode;
}
return front;
}

Deleting two elements from stack using linked list (say 30,20)

(30,200)----->(20,100)-----> (10,NULL)

300-----------> 200-------------> 100

top

(now top is at 300)

Delete 30 from stack

(20,100)----------->(10,NULL)

200 ------------------->100

top

Delete 20 from stack

(10,NULL)

100

top

Code for deleting element from stack using linked list

void delete()
{
struct Node* temp;
temp=top;
if(top==NULL)
{
printf("stack is empty");
}
else
{
top=top->next;
free(temp);
}
}

Deleting two elements from queue using linked list (say 10,20)

((10,200)------------>(20,300)------>(30,NULL)

100-------------------> 200--------------> 300

front ----------------------------------------- rear

Delete 10 from queue

(20,300)------>(30,NULL)

200---------------> 300

front ----------------rear

Delete 20 from queue

(30,NULL)

300

front

rear

Code for deleting element from queue using linked list

void delete()
{
struct Node* temp;
temp=front;
if(front==NULL)
{
printf("queue is empty");
}
if(front==rear) //if there is only one element in queue to be removed
{
free(temp);
front=NULL;
rear=NULL;
}
else
{
front=front->next;
free(temp);
}
}