-
Notifications
You must be signed in to change notification settings - Fork 0
/
CircularSinglyLinkedList.c++
96 lines (79 loc) · 1.67 KB
/
CircularSinglyLinkedList.c++
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
#include <iostream>
using namespace std;
class Node{
public:
int data;
Node* next;
Node(int d){
this -> data = d;
this -> next = NULL;
}
~Node(){
int value = this -> data;
if( this -> next != NULL)
{
delete next;
next = NULL;
}
}
};
void insertAtNode(Node* &tail, int element, int d){
if(tail == NULL)
{
Node* newNode = new Node(d);
tail = newNode;
newNode -> next = newNode;
}
else
{
Node* curr = tail;
while (curr -> data != element)
{
curr = curr -> next;
}
Node* temp = new Node(d);
temp -> next = curr -> next;
curr -> next = temp;
}
}
void print(Node* tail)
{
Node* temp = tail;
cout << tail -> next << " ";
do
{
cout << tail -> data << " ";
tail = tail -> next;
}while (tail != temp);
cout << endl;
}
void deleteNode(Node* &tail, int value)
{
if (tail == NULL)
{
cout << " List is empty " << endl;
return;
}
else
{
Node* prev = tail;
Node* curr = prev -> next;
while (curr -> data != value)
{
prev = curr;
curr = curr -> next;
}
prev -> next = curr -> next;
curr -> next = NULL;
delete curr;
}
}
int main(){
Node* tail = NULL; // Initialize tail to NULL to represent an empty list.
insertAtNode(tail, 5, 3); // Insert a node with data 10.
// Now, 'tail' is pointing to the created node forming a circular list.
print(tail);
insertAtNode(tail,3,5);
print(tail);
return 0;
}