forked from bgopesh/Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathlinkedLists.cpp
More file actions
409 lines (298 loc) · 7.76 KB
/
linkedLists.cpp
File metadata and controls
409 lines (298 loc) · 7.76 KB
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
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
/*
All Linked List Operations!!
*/
#include <iostream>
#include <string>
#include<string.h>
#include<algorithm>
#include <sstream>
using namespace std;
class Node{
public:
Node(){data_ =0;next =nullptr;}
//insert operations
Node* insertNodeatBegining(int data, Node *head);
void insertNodeatLast(int data, Node *head);
void insertNodeAfter(int data, int newdata, Node *head);
void insertNodeInMiddle(int data, int list_length, Node *head);
//delete operations
void deleteLastNode(Node *head);
void deleteNodeAfter(int data, Node *head);
void deleteNodeInMiddle(int list_length, Node *head);
Node * deletetheFirstNode(Node *head);
void deletetheGivenNode(int data, Node *head);
Node* deleteAllNodes(Node *head);
//list list's contents
void displayList(Node *head);
//is list circular?
bool isListCircular(Node *head);
//reverse the list
Node * reverseList(Node *head);
//get length of list
int listLength(Node *head);
private:
int data_;
Node * next;
};
Node* Node::insertNodeatBegining(int data, Node *head)
{
class Node *newnode = new Node();
if (head == nullptr)
{
newnode->data_ =data;
newnode->next =nullptr;
head = newnode;
}
else
{
newnode->data_ = data;
newnode->next = head;
head = newnode;
}
return head;
}
void Node::insertNodeatLast(int data, Node *head)
{
class Node *newnode = new Node();
class Node * tmp;
tmp = head;
while(tmp->next != nullptr)
{
tmp = tmp->next;
}
newnode->next =nullptr;
newnode->data_ = data;
tmp->next = newnode;
}
void Node::insertNodeAfter(int data, int newdata, Node *head)
{
class Node *newnode = new Node();
class Node * currentNode;
currentNode = head;
while(currentNode->data_ != data)
{
currentNode = currentNode->next;
}
newnode->data_ = newdata;
newnode->next = currentNode->next;
currentNode->next = newnode;
}
void Node::insertNodeInMiddle(int data, int list_length, Node *head)
{
auto listcounter = 1;
class Node *currentNode = head;
while(listcounter < (list_length/2) )
{
currentNode = currentNode->next;
listcounter++;
}
class Node * newnode = new Node();
newnode->data_ = data;
newnode->next = currentNode->next;
currentNode->next =newnode;
}
void Node::deleteLastNode(Node *head)
{
class Node * previousNode;
class Node * currentNode = new Node();
previousNode = head;
while(previousNode->next->next != nullptr)
{
previousNode = previousNode->next;
}
//copy last node to current node
currentNode->data_ = previousNode->next->data_;
currentNode->next = previousNode->next->next;
previousNode->next = nullptr;
//delete current node
delete currentNode;
}
void Node::deleteNodeAfter(int data, Node *head)
{
class Node * previousNode;
class Node * tmpNode;
tmpNode = head;
while(tmpNode != nullptr && tmpNode->data_ != data)
{
previousNode = tmpNode;
tmpNode= tmpNode->next;
}
previousNode->next = tmpNode->next;
//delete tmp node
delete tmpNode;
}
void Node::deleteNodeInMiddle(int list_length, Node *head)
{
class Node * previousNode;
auto listcounter = 1;
int loop_range;
class Node * currentNode = new Node();
previousNode = head;
if(list_length/2 ==0)
{
loop_range = list_length/2 + 1;
}
else
{
loop_range = list_length/2 + 1;
}
while(listcounter < loop_range )
{
previousNode = previousNode->next;
listcounter++;
}
//copy last node to current node
currentNode->data_ = previousNode->next->data_;
currentNode->next = previousNode->next->next;
previousNode->next = currentNode->next;
//delete current node
delete currentNode;
}
Node * Node::deletetheFirstNode(Node *head)
{
class Node * currentNode;
currentNode = head->next;
delete head;
return currentNode;
}
Node * Node::reverseList(Node *head)
{
Node *prev = nullptr;
Node *fut = nullptr;
Node *curr = head;
while(curr != nullptr)
{
fut = curr->next;
curr->next = prev;
prev = curr;
curr = fut;
}
head = prev;
return head;
}
void Node::displayList(Node *head)
{
if(head != nullptr)
{
class Node * tmp;
tmp = head;
while(tmp != nullptr)
{
cout << tmp->data_ << ": " <<& (tmp->data_)<< ":--> " << tmp->next << endl;
tmp = tmp->next;
}
}
else
{
cout << "list is empty " <<endl;
}
}
void Node::deletetheGivenNode(int data, Node *head)
{
class Node * previousNode;
class Node * currentNode = new Node();
previousNode = head;
while(previousNode->next->data_ != data)
{
previousNode = previousNode->next;
}
//copy last node to current node
currentNode->data_ = previousNode->next->data_;
currentNode->next = previousNode->next->next;
previousNode->next = currentNode->next;
//delete current node
delete currentNode;
}
Node* Node::deleteAllNodes(Node *head)
{
class Node * cureentNode;
class Node * nextNode = new Node();
cureentNode = head;
while(cureentNode != nullptr)
{
//copy next node
nextNode->data_ = cureentNode->next->data_;
nextNode->next = cureentNode->next->next;
delete cureentNode;
cureentNode = nextNode->next;
}
head = nullptr;
return head;
}
int Node::listLength(Node *head)
{
class Node * current = head;
int listLength = 0;
while(current != nullptr)
{
listLength++;
current = current->next;
}
return listLength;
}
bool Node::isListCircular(Node *head)
{
Node *current = head->next;
while((current !=head) && (current !=nullptr))
{
current = current->next;
}
if(current ==head)
{
return true;
}
else{return false;}
}
int main(void) {
Node * newhead =nullptr;
Node node;
//Add Node in beginning
newhead = node.insertNodeatBegining(500, newhead);
newhead = node.insertNodeatBegining(400, newhead);
newhead = node.insertNodeatBegining(300, newhead);
newhead = node.insertNodeatBegining(200, newhead);
newhead = node.insertNodeatBegining(100, newhead); //first Node
//Add Node in last
node.insertNodeatLast(600,newhead);
node.insertNodeatLast(700,newhead);
node.insertNodeatLast(800,newhead);
node.insertNodeatLast(900,newhead); //Last Node
//insert node after data
node.insertNodeAfter(300,400,newhead);
//Delete last node
node.deleteLastNode(newhead);
//Delete node after data
node.deleteNodeAfter(500, newhead);
//check length of list
int list_length = node.listLength(newhead);
//insert node in middle
node.insertNodeInMiddle(350, list_length,newhead);
node.insertNodeInMiddle(450, list_length,newhead);
node.insertNodeInMiddle(550, list_length,newhead);
//delete node in middle
node.deleteNodeInMiddle(list_length,newhead);
//delete first node
newhead = node.deletetheFirstNode(newhead);
//delete the given node
node.deletetheGivenNode(350,newhead);
//display list
node.displayList(newhead);
//reverse the list
newhead = node.reverseList(newhead);
//check if list is circular
bool circular_list = node.isListCircular(newhead);
if(circular_list)
{
cout << "list is circular" << endl;
}
else{
cout << "single linked list" << endl;
}
//display list
node.displayList(newhead);
//Delete all Nodes
newhead = node.deleteAllNodes(newhead);
//display list
node.displayList(newhead);
return 0;
}