Advertisement
stsharin

Untitled

Mar 3rd, 2018
80
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.10 KB | None | 0 0
  1. #include<stdio.h>
  2. #include<stdlib.h>
  3.  
  4. typedef struct Node{
  5. int data;
  6. struct Node *next;
  7. }node;
  8.  
  9. node *head;
  10.  
  11. void deletData(int data){
  12. node *current=head;
  13. node *previous;
  14. if(current->data==data){
  15. head=head->next;
  16. free(current);
  17. }
  18. else{
  19. while(current!=NULL && current->data!=data){
  20. previous=current;
  21. current=current->next;
  22. }
  23. previous->next=current->next;
  24. free(current);
  25. }
  26. }
  27.  
  28. void printData(){
  29. node *current=head;
  30. printf("New node is:");
  31. while(current!=NULL){
  32. printf("%d ",current->data);
  33. current=current->next;
  34. }
  35. printf("\n");
  36. }
  37.  
  38. int main()
  39. {
  40. int n;
  41. head=(node*)malloc(sizeof(node));
  42. head->data=5;
  43. head->next=(node*)malloc(sizeof(node));
  44. head->next->data=3;
  45. head->next->next=(node*)malloc(sizeof(node));
  46. head->next->next->data=7;
  47. head->next->next->next=(node*)malloc(sizeof(node));
  48. head->next->next->next->data=2;
  49. head->next->next->next->next=NULL;
  50.  
  51. printf("Enter the data you want to delete: ");
  52. scanf("%d",&n);
  53. deletData(n);
  54. printData();
  55. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement