-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdoubleLinkedList.cpp
More file actions
184 lines (163 loc) · 2.6 KB
/
Copy pathdoubleLinkedList.cpp
File metadata and controls
184 lines (163 loc) · 2.6 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
//Double linked list
#include<iostream>
#include<stdbool.h>
using namespace std;
template <class T>
class foo;
template<class T>
class Node
{
private:
Node<T> *next;
Node<T> *prev;
T data;
public:
Node(){}
Node(T d)
{
data=d;
next=0;
prev=0;
}
void display()
{
cout<<data;
}
friend class foo<T>;
};
template<class T>
class foo
{
public:
Node<T> *start;
foo()
{
start = 0;
}
bool isEmpty()
{
return(start == 0);
}
int getLength();
bool search(T key);
void insert(int pos, T data);
void Delete(int pos);
void displayList();
};
template<class T>
int foo<T>::getLength()
{
int count = 0;
Node<T> *curr = start;
while(curr!=0)
{
count++;
curr = curr->next;
}
return count;
}
template<class T>
bool foo<T>::search(T key)
{
Node<T> *curr = start;
while(key != curr->data && curr!=0)
curr->prev=curr;
curr=curr->next;
if(curr !=0)
return true;
return false;
}
template<class T>
void foo<T>::insert(int pos,T ele)
{
Node<T> *temp = new Node<T>(ele);
// cout<<"testmode";
if(isEmpty())
{
start = temp;
// cout<<"testing";
}
else if(pos==1)
{
temp->next=start;
start->prev=temp;
start=temp;
}
else
{
int i=0;
// cout<<"entered else";
Node<T> *curr = start;
while(i < pos-1 && curr->next !=0)
{
i++;
// cout<<"hmmm";
curr = curr->next;
}
if(curr->next != 0)
{
temp->next = curr->next;
curr->next->prev=temp;
}
curr->next=temp;
temp->prev=curr;
}
}
template<class T>
void foo<T>::displayList()
{
Node<T> *curr = start;
cout<<"\nStart:\n";
while(curr!=0)
{
curr->display();
cout<<" ";
curr = curr->next;
}
}
template<class T>
void foo<T>::Delete(int pos)
{
if(isEmpty() || pos > getLength())
cout<<"\nWRONG POS TO DELETE\n";
else
{
Node<T> *curr;
curr = start;
if(pos == 1)
start = start->next;
int i=1;
while(curr->next!=0 && i != pos)
{
i++;
curr->prev = curr;
curr = curr->next;
}
if(curr == 0 || i!=pos)
cout<<"\nError!\n";
curr->prev->next = curr->next;
cout<<"\nDelete done\n";
}
}
int main()
{
for(int j=0;j<40;j++)
cout<<"-";
cout<<endl;
foo<int> l1;
cout<<"testing for empty:"<<l1.isEmpty()<<endl;
l1.insert(1,10);
l1.insert(2,20);
l1.displayList();
l1.insert(3,15);
l1.insert(4,40);
l1.displayList();
cout<<"\ntrying to delete pos 2:";
l1.Delete(2);
l1.displayList();
cout<<endl;
for(int j=0;j<40;j++)
cout<<"-";
cout<<endl;
return 0;
}