#include<stdio.h>
#include<malloc.h>
struct node
{
int data;
struct node *link;
} *start;
int main()
{
int n,**1,no,flag=0,pos=1;
struct node *ptr,*c,*cur,*p;
printf("Enter how many nodes in your linked list:");
scanf("%d",&n);
printf("Input node 1 data:");
ptr=(struct node*)malloc(sizeof(struct node));
scanf("%d",&ptr->data);
start=ptr;
for(**1;i<n;i++)
{
printf("Enter node %d data:",i+1);
p=(struct node*)malloc(sizeof(struct node));
scanf("%d",&p->data);
p->link=NULL;
cur=start;
while(cur->link!=NULL)
{
cur=cur->link;
}
cur->link=p;
}
printf("Enter number to Delete:");
scanf("%d",&no);
p=start;
while(p!=NULL)
{
if(p->data==no)
{
flag=1;
break;
}
p=p->link;
pos++;
}
if(flag==1)
{
if(pos==1)
{
p=start;
start=p->link;
free(p);
}
else
{
**1;
p=start;
cur=p;
while(i<pos)
{
cur=p;
p=p->link;
i++;
}
cur->link=p->link;
free(p);
}
printf("\n%d is Deleted..... ",no);
printf("\nAfter deleting Displaying linked list....\n");
c=start;
while(c!=NULL)
{
printf("->%d",c->data);
c=c->link;
}
}
else
{
printf("%d is not present in this linked list",no);
}
}