Question

In C program

1. Create a Linked List of type Float. (including the functions specified below) a. Insertion i. at the Beginning, ii. at the End, iii. after the node containing the value (given as parameter) X. b. Deletion i. at the Beginning, ii. at the End, iii. of the node containing the value (given as parameter) X.

Answer 1

//C-program to illustrate inserting and deleting from linklist

#include<stdio.h>

#include<stdlib.h>

//Link list structure for of type float start is the starting of our linklist

struct linkList

{

float data;

struct linkList *next;

}*start=NULL,*q,*temp,*prev;

//This function inserts new value at the start of the linklist

void insertAtBegin()

{

float num;

//create temporary objet to hold new data

temp = (struct linkList*)malloc(sizeof(struct linkList));

printf("Enter data: ");

scanf("%f",&num);

temp->data = num;

temp->next = NULL;

//If list is empty

if(start == NULL){

temp->next = NULL;

start = temp;

}else{

temp->next = start; //appends all list to end of temp

start = temp; //assign new start

}

}

//This function inserts new value at the end of the linklist

void insertAtEnd()

{

float num;

//create temporary objet to hold new data

temp=(struct linkList*)malloc(sizeof(struct linkList));

printf("Enter data: ");

scanf("%f",&num);

temp->data = num;

temp->next = NULL;

//If list is empty

if(start == NULL){

start = temp;

}else{

q = start;

while(q->next!=NULL) //traverse list upto the last value

q = q->next;

q->next = temp; //attach temp data to the list at end

}

}

//This function inserts new value After the node pass in parameter linklist

int insertAfterValue(float nodeValue)

{

float num;

if(start == NULL){

printf("List is empty!! Fail to insert");

return 0;

}

//create temporary objet to hold new data

temp = (struct linkList*)malloc(sizeof(struct linkList));

printf("Enter data:");

scanf("%f",&num);

temp->data=num;

temp->next = NULL;

q = start;

if(q->data == nodeValue){

temp->next = q->next;

q->next = temp;

return 0;

}

//traverse list upto the last value and node not holds nodeVlue

while(q!=NULL && q->data != nodeValue){

q = q->next;

}

if(q == NULL)

printf("Node Value Not Found Fail to insert");

else{

temp->next = q->next;

q->next = temp ;//attach temp data to next value to node

}

return 0;

}

//This is Display the list

void display()

{

if(start == NULL){

printf("Link List is empty!!");

}else{

q = start;

printf("The Linked list is : \n\t");

//Traverse node by node and print value

while(q != NULL){

if(q->next != NULL){

printf("%.2f-> ", q->data); //%.2f prints output upto 2 decimal places

q = q->next;

}else{

printf("%.2f-> NULL", q->data);

q = q->next;

}

}

}

}

//This function Delete value from the start of the linklist

void deleteFromBegin()

{

if(start == NULL){

printf("The list is empty!!");

}else{

q = start;

start = start->next; //list start pointer move to next element

printf("Deleted element is %.2f ", q->data);

free(q); //free memory

}

}

//This function Delete value from the end of the linklist

void deleteFromEnd()

{

if(start == NULL){

printf("The list is empty!!");

}else{

q = start;

while(q->next->next != NULL) //travese upto second last element

q = q->next;

temp = q->next; //Holds data to be delete

q->next = NULL;

printf("Deleted element is %.2f ", temp->data);

free(temp); //free memory

}

}

//This function delete value of the node pass in parameter linklist

int deleteNode(float nodeValue)

{

if(start == NULL){

printf("List is empty!!");

return 0;

}

q = prev = start;

if(q->data == nodeValue){

temp = q;

start = q->next;

free(temp);

return 0;

}

//traverse list upto the last value and node not holds nodeVlue

while(q!=NULL && q->data != nodeValue){

prev = q;

q = q->next;

}

if(q == NULL)

printf("Node Value Not Found");

else{

temp = q ;

prev->next = q->next ; //attach prev node to next value to node

printf("Deleted element is %.2f ", temp->data);

free(temp); //free memory

}

return 0;

}

int main(){

int ch; //for getting choice from user

float num;

//executing till user enter exit choice

while(1){

//Show all menu option to the user

printf("\n\n**************************************");

printf("\n** Singly Float Linked List Menu **");

printf("\n**************************************\n");

printf("\n1) Insert\n2) Display\n3) Delete\n4) Exit\n\n");

printf("Enter your choice(1-4): ");

scanf("%d",&ch);

switch(ch){

case 1:

//Give option to insert the value in the linklist

printf("\n---- Insert Menu ----");

printf("\n1. at the Beginning,\n2. at the end,\n3. After the node value");

printf("\n\nEnter your choice(1-3): ");

scanf("%d",&ch);

switch(ch)

{

case 1: insertAtBegin();

break;

case 2: insertAtEnd();

break;

case 3:

printf("\nEnter node value to insert after: ");

scanf("%f",&num);

insertAfterValue(num);

break;

default: printf("Wrong Choice!!");

}

break;

case 2: display();

break;

case 3:

//Give option to Delete the value in the linklist

printf("\n---- Delete Menu ----");

printf("\n1. at the Beginning,\n2. at the end,\n3. Node value");

printf("\n\nEnter your choice(1-3): ");

scanf("%d",&ch);

switch(ch)

{

case 1: deleteFromBegin();

break;

case 2: deleteFromEnd();

break;

case 3:

printf("\nEnter node value to delete: ");

scanf("%f",&num);

deleteNode(num);

break;

default: printf("Wrong Choice!!");

}

break;

case 4: exit(0);

default: printf("Wrong Choice!!");

}

}

return 0;

}