-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathliked_list.cpp
103 lines (85 loc) · 1.71 KB
/
liked_list.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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
#include<iostream>
using namespace std;
class node{
public:
int data;
node* next;
node(int val){
data =val;
next=NULL;
}
};
void insertAtTail(node* &head, int val){
node* n = new node(val);
if(head==NULL){
head=n;
return;
}
node* temp=head;
while(temp->next!=NULL){
temp=temp->next;
}
temp->next=n;
}
void insertAtHead(node* &head, int val){
node* n = new node(val);
n->next=head;
head=n;
}
void display( node* head){
node* temp=head;
while(temp!=NULL){
cout<<temp->data<<" ";
temp=temp->next;
}
cout<<endl;
}
bool search(node* &head, int key){
node* temp=head;
while(temp!=NULL){
if(temp->data==key){
return 1;
}
temp=temp->next;
}
return 0;
}
void deleteAtHead(node* &head){
node* todelete=head;
head=head->next;
delete todelete;
}
void deletion(node* &head, int val){
if(head==NULL){
return;
}
if (head->next==NULL || head->data==val){
deleteAtHead(head);
return;
}
node* temp=head;
while(temp->next->data!=val){
temp=temp->next;
}
node* todelete=temp->next;
temp->next=temp->next->next;
delete todelete;
}
int main(){
node* head = NULL;
insertAtTail(head, 1);
insertAtTail(head, 2);
insertAtTail(head, 3);
insertAtTail(head, 4);
insertAtTail(head, 5);
display(head);
// insertAtHead(head, 6);
// deleteAtHead(head);
deletion(head, 1);
// deletion(head, 2);
// deletion(head, 3);
// deletion(head, 4);
display(head);
// cout<<search(head, 7);
return 0;
}