forked from nitishji/Beginners_algorithm_guide
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathDeleting a node.cpp
66 lines (54 loc) · 1.09 KB
/
Deleting a node.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
#include<bits/stdc++.h>
using namespace std;
class Node
{
public:
int data;
Node* next;
};
void push(Node** head_ref,int new_data)
{
Node* new_node=new Node();
new_node->data=new_data;
new_node->next=(*head_ref);
(*head_ref)=new_node;
}
void deleteNode(Node** head_ref,int key)
{
Node* temp=(*head_ref),*prev;
if (temp != NULL && temp->data == key)
{
*head_ref = temp->next; // Changed head
free(temp); // free old head
return;
}
while (temp != NULL && temp->data != key)
{
prev = temp;
temp = temp->next;
}
if (temp == NULL) return;
prev->next = temp->next;
free(temp);
}
void printList(Node *node)
{
while (node != NULL)
{
cout<< node->data;
node = node->next;
}
}
int main()
{
Node* head = NULL;
push(&head, 7);
push(&head, 1);
push(&head, 3);
push(&head, 2);
puts("Created Linked List: ");
printList(head);
deleteNode(&head, 1);
puts("\nLinked List after Deletion of 1: ");
printList(head);
}