-
Notifications
You must be signed in to change notification settings - Fork 51
/
LL.cpp
251 lines (235 loc) · 3.87 KB
/
LL.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
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
#include<iostream>
using namespace std;
struct node{
int data;
node *next;
};
class linked_list
{
private:
node *head;
public:
linked_list()
{
head = NULL;
}
void add_end(int n);
void display();
void add_begin(int n);
void add_at_position(int n, int pos);
void delete_begin();
void delete_end();
void delete_at_position(int n);
void search(int data);
void delete_duplicate(int data);
void display_middle();
void reverse();
};
void linked_list::add_end(int n){
node *temp= new node;
temp -> data =n;
temp -> next = NULL;
if(head == NULL)
{
head = temp;
}
else{
node *ptr = head;
while(ptr -> next != NULL)
{
ptr = ptr -> next;
}
ptr -> next = temp;
}
}
void linked_list::add_begin(int n){
node *temp= new node;
temp -> data =n;
temp -> next = NULL;
temp -> next = head;
head = temp;
}
void linked_list::add_at_position(int n, int pos)
{
if(head == NULL)
{
cout<<"LL Empty list"<<endl;
return;
}
if(pos==1)
{
add_begin(n);
return;
}
node *temp = new node;
temp -> data = n;
temp -> next = NULL;
node *ptr = head;
int c=1;
while(c<pos-1)
{
ptr = ptr -> next;
c++;
}
temp -> next = ptr -> next;
ptr -> next = temp;
}
void linked_list::display()
{
node *ptr = head;
while(ptr -> next != NULL)
{
cout<<ptr->data<<endl;
ptr = ptr -> next;
}
cout<<ptr->data<<endl;
}
void linked_list::delete_begin()
{
node* ptr=head;
head=head->next;
delete(ptr);
ptr=NULL;
}
void linked_list::delete_end()
{
node *ptr=head;
while((ptr->next)->next != NULL)
{
ptr = ptr->next;
}
delete(ptr->next);
ptr->next = NULL;
}
void linked_list::delete_at_position(int n)
{
if(n==1)
{
delete_begin();
return;
}
node *ptr = head;
for(int i=1;i<n-1;i++)
{
ptr = ptr->next;
}
node *temp=ptr->next;
if(temp->next == NULL)
{
delete_end();
return;
}
ptr->next=temp->next;
delete(temp);
temp=NULL;
}
void linked_list::search(int data)
{
if(head->data==data)
{
cout<<"Node found at position 1"<<endl;
return;
}
node *ptr = head;
int pos=1;
while(ptr->next != NULL)
{
ptr = ptr->next;
pos++;
if(ptr->data == data)
break;
}
if(ptr->next == NULL && ptr->data!=data)
{
cout<<"Node not found"<<endl;
return;
}
cout<<"Node found at position "<<pos<<endl;
}
void linked_list::delete_duplicate(int data)
{
node *ptr = head;
while(head->data==data)
{
ptr = ptr->next;
delete_begin();
}
while(ptr->next != NULL)
{
if((ptr->next)->data == data)
{
node *temp=ptr->next;
ptr->next=temp->next;
delete(temp);
temp=NULL;
}
if(ptr->next != NULL && (ptr->next)->data != data)
ptr = ptr->next;
}
if(ptr->data == data)
{
delete_end();
}
}
void linked_list::display_middle()
{
if(head == NULL)
{
cout<<"List is Empty"<<endl;
return;
}
node *slow=head;
node *fast=head;
while(fast!=NULL && fast->next != NULL)
{
fast=(fast->next)->next;
slow=slow->next;
}
cout<<"Middle node is "<<slow->data<<endl;
}
void linked_list::reverse()
{
node *ptr = head;
node *first=head;
while(ptr->next != NULL)
{
ptr = ptr->next;
add_begin(ptr->data);
}
first->next=NULL;
first=NULL;
}
int main(){
int data;
int pos;
linked_list list;
cout<<"Enter data"<<endl;
for(int i=1;i<=7;i++)
{
cin>>data;
list.add_end(data);
}
cout<<"List is"<<endl;
list.display();
cout<<"Enter the position to add data and data at that positon"<<endl;
cin>>pos;
cin>>data;
list.add_at_position(data,pos);
list.display();
// cout<<"Enter the position to remove data"<<endl;
// cin>>pos;
// list.delete_at_position(pos);
// cout<<"List is"<<endl;
// list.display();
// cout<<"Enter data to search"<<endl;
// cin>>data;
// list.search(data);
// cout<<"Enter data to delete duplicate"<<endl;
// cin>>data;
// list.delete_duplicate(data);
// cout<<"List is"<<endl;
// list.display();
// cout<<"Reversing"<<endl;
// list.reverse();
// list.display();
}