-
Notifications
You must be signed in to change notification settings - Fork 0
/
DoublyLinkedList.cpp
247 lines (215 loc) · 5.76 KB
/
DoublyLinkedList.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
#include<iostream>
using namespace std;
class DounlyLinkedList{
private:
class Node{
public:
int Data;
Node* Next;
Node* Prev;
};
Node *Head;
Node *Tail;
int Length;
public:
DounlyLinkedList(){
Head = Tail = NULL;
Length = 0;
}
void insertFirst(int element) {
Node *newNode = new Node;
newNode->Data = element;
newNode->Next = Head;
newNode->Prev = NULL;
if (Head != NULL) {
Head->Prev = newNode;
} else {
// If the list was empty, newNode is both Head and Tail
Tail = newNode;
}
Head = newNode;
Length++;
}
void insertLast(int element) {
Node *newNode = new Node;
newNode->Data = element;
newNode->Next = NULL;
if (Head == NULL) {
Head = Tail = newNode;
newNode->Prev=NULL;
} else {
newNode->Prev=Tail;
Tail->Next = newNode;
Tail = newNode;
}
Length++;
}
void insertAtPos(int element, int Pos) {
if (Pos == 0) {
insertFirst(element);
} else if (Pos == Length) {
insertLast(element);
} else if (Pos > Length || Pos < 0) {
cout << "Position out of range" << endl;
} else {
Pos--; // Adjusting position to match zero-based indexing
Node *newNode = new Node;
newNode->Data = element;
Node *Temp = Head;
while (Pos--) {
Temp = Temp->Next;
}
newNode->Next = Temp->Next;
Temp->Next->Prev = newNode;
newNode->Prev = Temp;
Temp->Next = newNode;
Length++;
}
}
void removeFirst(){
if (Head==NULL){
cout<<"The list is aready empty\n";
}else if (Head==Tail){
delete Head;
Head = Tail = NULL;
Length--;
}else {
Node *Temp = Head;
Head = Head->Next;
if (Head != NULL) {
Head->Prev = NULL;
} else {
// If Head->Next is NULL, Head is now the only node in the list
Tail = NULL;
}
delete Temp;
Length--;
}
}
void removeLast(){
if (Tail==NULL){
cout<<"The list is aready empty\n";
}else if (Tail==Head){
delete Tail;
Tail = Head = NULL;
Length--;
}else{
Node *Temp = Tail;
Tail = Tail->Prev;
if (Tail != NULL) {
Tail->Next = NULL;
}else{
// If Tail->Prev is NULL, Tail is now the only node in the list
Head = NULL;
}
delete Temp;
Length--;
}
}
void removeAtPos(int Pos){
if (Pos==0){
removeFirst();
}else if (Pos == Length - 1) {
removeLast();
}else if (Pos>Length || Pos<0){
cout<<"Position out of range"<<endl;
}else{
Pos--; // Adjusting position to match zero-based indexing
Node *Temp = Head;
while (Pos--){
Temp=Temp->Next;
}
Node *ToDelete = Temp->Next;
Temp->Next = Temp->Next->Next;
if (Temp->Next != NULL) {
Temp->Next->Prev = Temp;
} else {
// If the next node is NULL, the deleted node was the previous Tail
Tail = Temp;
}
delete ToDelete;
Length--;
}
}
int getLength(){
int len=0;
Node *currentNode = Head;
while (currentNode!= NULL){
len++;
currentNode = currentNode->Next;
}
return len;
}
void atPos(int Pos){
if (Pos==0){
cout<<Head->Data<<endl;
}else if (Pos==this->getLength()-1){
cout<<Tail->Data<<endl;
}else if (Pos>=this->getLength()){
cout<<"Position out of range"<<endl;
}else{
Node *Temp = Head;
while (Pos--){
Temp=Temp->Next;
}
cout<<Temp->Data<<endl;
}
}
int find(int element){
Node *Temp=Head;
int index=0;
while (Temp!=NULL){
if (Temp->Data==element){
return index;
}
Temp=Temp->Next;
index++;
}
return -1;
}
void traverseForward(){
if (Head == NULL){
cout << "List is empty" << endl;
return;
}
Node *currentNode = Head;
while (currentNode->Next != NULL){
cout << currentNode->Data << " -> ";
currentNode = currentNode->Next;
}
cout << Tail->Data << endl;
}
void traverseBackward(){
if (Head == NULL){
cout << "List is empty" << endl;
return;
}
Node *currentNode = Tail;
while (currentNode->Prev != NULL){
cout << currentNode->Data << " -> ";
currentNode = currentNode->Prev;
}
cout << Head->Data << endl;
}
};
int main(){
DounlyLinkedList list;
int x=10;
while (x--){
list.insertFirst(x);
}
list.traverseForward();
list.removeFirst();
list.removeLast();
list.insertFirst(0);
list.insertLast(9);
list.removeAtPos(3);
list.insertAtPos(3,3);
list.traverseForward();
list.traverseBackward();
list.atPos(3);
cout<<list.getLength()<<endl;
cout<<list.find(9)<<endl;
cout<<list.find(10)<<endl;
return 0;
}