Question

how to delete a node from a linked list, at beginning middle or end. show the functions for each and explain each step. in C

Answer 1

/* Linked List Maintained for deletion cases as per your choice */
#include<stdio.h>
#include<conio.h>
struct list
{
int data;//Input is of type Integer
struct list *next;//pointer of type struct list
};
main()
{
struct list *head,*ptr,*ptr1,*temp,*temp1,*temp2,*temp3,*pos;
char ch,i;
clrscr();
printf("How many nodes you want in your Linked List : ");
scanf("%d",&ch);
printf("Enter 1 Value in Linked List :\n");
ptr=(struct list*)malloc(sizeof(struct list*));
scanf("%d",&ptr->data);
ptr->next=NULL;
head=ptr;
temp3=ptr;
temp=ptr;
temp1=ptr;
temp2=ptr;
for(i=1;i<=ch-1;i++)
{
ptr=createlinked_list(ptr,i);
}
printf("The data in the nodes are as follows : \n ");
while(temp!=NULL)
{
printf("\t %d",temp->data);
temp=temp->next;
}
printf("\n Performing Deletion at beginning : \n ");
head=deletion_atbeg(head,temp1);
printf("The result after deletion at beginning : \n");
while(head!=NULL)
{
printf("\t %d",head->data);
head=head->next;
}
printf("\n Enter position which you want to delete : \n ");
scanf("%d",&pos);
deletion_atmid(temp3);
//printf("%d",temp3->next->data);
head=deletion_atend(temp2,ch);
printf("\n After Deletion at end : \n ");
while(head!=NULL)
{
printf("\t %d",head->data);
head=head->next;
}
getch();
}
deletion_atmid(struct list *start,int k)
{
struct list *temp5;
temp5=start;
start->next=start->next->next;
//printf("%d",start->next->data);
printf("\n The Data after your choice deletion is as follows : ");
while(temp5!=NULL)
{
printf("\n \t%d",temp5->data);
temp5=temp5->next;
}
}
deletion_atbeg(struct list *temp_head,struct list *fnode)
{
temp_head=fnode->next;
return temp_head;
}
deletion_atend(struct list *lnode,int k)
{
struct list *temp=lnode;
int j;
while(lnode->next->next!=NULL)
{
lnode=lnode->next;
}
lnode->next=NULL;
return temp;
}
createlinked_list(struct list *temp,int k)
{
struct list *temp1;
temp1=(struct list*)malloc(sizeof(struct list*));
printf("Enter %d value in Linked List : \n ",k+1);
scanf("%d",&temp1->data);
temp->next=temp1;
temp1->next=NULL;
return temp1;
}