struct node

{

int data;

struct node * next;

}list;

for deleting a node from list first we have read a element which u want to delete and then we have identify previous node of that element.

scanf("%d",&x);

void deletenode(struct node * list)

{struct node * l1=list,temp;

if (l1->data==x) l1=l1->next; //deleting first element

else

{

while (l1->next->data!=x) and (l1!=NULL) l1=l1->next;

temp=l1->next; //here l1 points to previous node

l1->next=l1->next->next;

delete (temp)

}

}

If you have the better answer, then send it to us. We will display your answer after the approval.

Name :*
Email Id :*
Answer :*
Verification Code	Not readable? Load New Code
Enter the above shown code:*
	Inform me about updated answers to this question