venkatesh

 Profile Answers by venkatesh Questions by venkatesh

• May 19th, 2006

 

Code
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)


}


}

Please let me know if u r facing any problem with this

Sukumar Paul

 Profile Answers by Sukumar Paul 

• Aug 1st, 2010

 

Yaa i am writing the full program here for better understanding:
This program will be run on Turbo C++ 3.0 without any error or warning.
<--------------------------------------------------------------------------------------------->

Code
#include


#include


//Declaring node of linklist


struct node 


{


int data;


struct node *link;


};


typedef struct node node;


 


//declaration of all function


void deletenode(node **p, int num);


void addatbeg(node **p, int num);


void display(node **p);


 


void main()


{


node *p = NULL; //initialize the pointer to NULL(it does not point to any node)


 


addatbeg(&p,10);


addatbeg(&p,129);


addatbeg(&p,67);


addatbeg(&p,23);


 


printf("nLinklist : n");


display(&p);


deletenode(&p,67);


 


printf("nAfter deleting node: n");


display(&p);


}


 


 


//this is the function by which we can delete a node from a linklist


 


void deletenode(node **head, int num)


{


 


// Here temp points to the current node and old points to the previous node


//num-->element to be deleted


 


node *temp, *old;


temp = *head;


int flag = 0;


 


while(temp != NULL)


{


if(temp->data == num) //if element found


{


flag = 1;


if(temp == *head)


{


*head = (*head)->link;


free(temp);


}


else


{


old->link = temp->link;


free(temp);


}


}


else //if element not found, go to the next node


{


old = temp;


temp = temp->link;


}


}


if(flag == 0)


printf("Element not found");


}


void addatbeg(node **head, int num)


{


node *temp;


if(*head == NULL)


{


temp = (node *)malloc(sizeof(node));


temp->data = num;


temp->link = NULL;


*head = temp;


}


else


{


temp = (node *)malloc(sizeof(node));


temp->data = num;


temp->link = *head;


*head = temp;


 


}


}


 


void display(node **head)


{


node *temp = *head;


while(temp != NULL)


{


printf("t %d",temp->data);


temp = temp->link; }


}


}

<----------------------------------------------------------------------------------------->

oly

• Sep 14th, 2014

 

What is the program for delete a list in an linked list?