-
Notifications
You must be signed in to change notification settings - Fork 51
/
Circular.cpp
203 lines (189 loc) · 2.82 KB
/
Circular.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
#include<iostream>
using namespace std;
struct node{
int data;
node *next;
};
class circular_ll{
node *start;
public:
circular_ll()
{
start=NULL;
}
void add_begin(int n);
void add_end(int n);
void display();
void display2();
void add_at(int n,int pos);
void delete_begin();
void delete_end();
void delete_at(int pos);
bool search(int n);
};
void circular_ll::add_begin(int n){
node *ptr=new node;
ptr->data=n;
ptr->next=NULL;
if(start==NULL)
{
start=ptr;
start->next=start;
return;
}
ptr->next=start->next;
start->next=ptr;
}
void circular_ll::add_end(int n){
node *ptr=new node;
ptr->data=n;
ptr->next=NULL;
if(start==NULL)
{
start=ptr;
start->next=start;
return;
}
ptr->next=start->next;
start->next=ptr;
start=ptr;
}
void circular_ll::add_at(int n,int pos){
node *ptr=start;
for(int i=1;i<pos;i++)
{
ptr=ptr->next;
if(ptr==start)
{
add_end(n);
return;
}
}
node *temp=new node;
temp->data=n;
temp->next=NULL;
temp->next=ptr->next;
ptr->next=temp;
}
void circular_ll::display()
{
if(start==NULL)
{
cout<<"List is empty"<<endl;
return;
}
node *ptr=start;
while(ptr->next!=start)
{
ptr=ptr->next;
cout<<ptr->data<<endl;
}
cout<<start->data<<endl;
}
void circular_ll::display2()
{
if(start==NULL)
{
cout<<"List is empty"<<endl;
return;
}
node *ptr=start;
do
{
ptr=ptr->next;
cout<<ptr->data<<endl;
}
while(ptr!=start);
cout<<start->next->data<<endl;
}
void circular_ll::delete_begin(){
if(start->next==start)
{
start=NULL;
return;
}
node *ptr=start->next;
start->next=ptr->next;
delete(ptr);
ptr=NULL;
}
void circular_ll::delete_end(){
if(start->next==start)
{
start=NULL;
return;
}
node *ptr=start;
while(ptr->next!=start)
{
ptr=ptr->next;
}
ptr->next=start->next;
delete(start);
start=NULL;
start=ptr;
}
void circular_ll::delete_at(int pos){
node *ptr=start;
for(int i=1;i<pos;i++)
{
ptr=ptr->next;
if(ptr->next==start)
{
delete_end();
return;
}
}
node *temp=ptr->next;
ptr->next=temp->next;
delete(temp);
temp=NULL;
}
bool circular_ll::search(int n){
node *ptr=start;
while(ptr->next!=start)
{
if(ptr->data==n)
{
return true;
}
ptr=ptr->next;
}
return false;
}
int main()
{
int data;
circular_ll list;
cout<<"Enter data"<<endl;
for(int i=1;i<=5;i++)
{
cin>>data;
list.add_end(data);
}
cout<<"List is"<<endl;
list.display();
// cout<<"Enter Position and data to add"<<endl;
// int pos;
// cin>>pos;
// cin>>data;
// list.add_at(data,pos);
// cout<<"List is"<<endl;
// list.display();
// cout<<"Enter position to delete"<<endl;
// int pos;
// cin>>pos;
// list.delete_at(pos);
// cout<<"List is"<<endl;
// list.display();
cout<<"Enter value to search"<<endl;
cin>>data;
if(list.search(data))
{
cout<<"Value present"<<endl;
}
else
{
cout<<"Value not present"<<endl;
}
}