-
Notifications
You must be signed in to change notification settings - Fork 0
/
cdll.cpp
168 lines (157 loc) · 2.02 KB
/
cdll.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
#include<iostream>
using namespace std;
struct Node
{
Node *prev;
int item;
Node *next;
}
class CDLL
{
private:
Node *start;
public:
CDLL();
void insertAtStart(int);
void insertLast(int);
Node* search(int);
void insertAfter(Node*,int);
void deleteFirst();
void deleteLast();
void deleteNode();
~CDLL();
};
CDLL::~CDLL()
{
while(start)
{
deleteFirst();
}
}
void CDLL::deleteNode(int data)
{
Node *t=start;
if(start->next==start && start->item==data)
{
delete start;
start=NULL;
}
else
{
do
{
if(t->next->item==data)
{
Node *r=t->next;
t->next=t->next->next;
t->next->next->prev=t;
delete r;
}
t=t->next;
}while(t!=start)
}
}
void CDLL::deleteLast()
{
if(start)
{
if(start->next==start)
{
delete start;
start=NULL;
}
else
{
Node *r=start->prev;
start->prev->prev->next=start;
start->prev=start->prev->prev;
delete r;
}
}
}
void CDLL::deleteFirst()
{
if(start)
{
if(start->next==start)
{
delete start;
start=NULL;
}
else
{
Node *r=start;
start->prev->next=start->next;
start->next->prev=start->prev;
start=start->next;
delete r;
}
}
}
void CDLL::insertAfter(Node *temp,int data)
{
if(temp)
{
Node* ptr=new Node;
ptr->item=data;
ptr->next=temp->next;
ptr->prev=temp;
temp->next->prev=ptr;
temp->next=ptr;
}
}
Node* CDLL::search(int data)
{
if(start)
{
Node *t=start;
do
{
if(t->item==data)
return t;
t=t->next;
}while(t!=start)
}
return NULL;
}
void CDLL::insertLast(int data)
{
Node *ptr=new Node;
ptr->item=data;
if(start)
{
ptr->next=start;
ptr->prev=start->prev;
start->prev=ptr;
start->prev->next=ptr;
}
else
{
ptr->next=ptr;
ptr->prev=ptr;
start=ptr;
}
}
void CDLL::insertAtStart(int data)
{
Node *ptr=new Node;
ptr->item=data;
if(start)
{
ptr->prev=start->prev;
ptr->next=start;
start->prev->next=ptr;
start->prev=ptr;
start=ptr;
}
else
{
ptr->next=ptr;
ptr->prev=ptr;
start=ptr;
}
}
CDLL::CDLL()
{
start=NULL;
}