Advertisement
vaibhav1906

Delete node

Jun 27th, 2021 (edited)
162
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.15 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. class Node{
  4. public:
  5. int val;
  6. Node * next;
  7. };
  8.  
  9. Node * insert(Node * head , int x){
  10. Node * a = new Node();
  11. a->val = x;
  12.  
  13. if(head==NULL){
  14. head = a;
  15. }
  16.  
  17. else{
  18. a->next = head;
  19. head = a;
  20. }
  21.  
  22.  
  23. return head;
  24. }
  25.  
  26. void printl(Node * head){
  27. Node * temp = head;
  28.  
  29. while(temp!=NULL){
  30. cout<<temp->val<<" ";
  31. temp = temp->next;
  32. }
  33.  
  34. cout<<endl;
  35.  
  36. }
  37.  
  38. Node * del (Node * head , int d){
  39. Node * temp = head;
  40.  
  41. if(head->val==d){
  42. Node* t = head;
  43.  
  44. head = head->next;
  45. free(t);
  46. return head;
  47. }
  48.  
  49. while(temp->next!=NULL && temp->next->val != d){
  50. temp = temp->next;
  51. }
  52.  
  53. if(temp->next==NULL)return head;
  54.  
  55. Node* y = temp->next;
  56.  
  57. temp->next = temp->next->next;
  58.  
  59. free(y);
  60.  
  61. return head;
  62.  
  63. }
  64.  
  65. int main(){
  66. int n;
  67. Node * head= NULL;
  68. cout<<"Enter the size of your linkedlist : \n";
  69. cin>>n;
  70.  
  71. for(int i=0; i<n; i++){
  72. cout<<"Enter a number : \n";
  73. int x; //3->2->1
  74. cin>>x;
  75. head = insert(head,x);
  76. }
  77.  
  78. printl(head);
  79.  
  80. cout<<"Enter a number you want to delete : \n";
  81. int d;
  82. cin>>d;
  83. head = del(head,d);
  84. printl(head);
  85.  
  86. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement