-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathdoubly_list.cpp
210 lines (209 loc) · 4.35 KB
/
doubly_list.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
#include<iostream>
using namespace std;
struct doubly_list
{
struct doubly_list*left;
int info;
struct doubly_list*right;
};
typedef struct doubly_list node;
node*start,*last;
void insert_beg(int num)
{
node*newnode;
newnode=(node*)malloc(sizeof(node));
newnode->left=NULL;
newnode->info=num;
newnode->right=NULL;
if(start==NULL)
start=last=newnode;
else
{
newnode->right=start;
start->left=newnode;
start=newnode;
}
}
void insert_end(int num)
{
node*newnode;
newnode=(node*)malloc(sizeof(node));
newnode->left=NULL;
newnode->right=NULL;
newnode->info=num;
if(start==NULL)
start=last=newnode;
else
{
last->right=newnode;
newnode->left=last;
last=newnode;
}
}
void insert_pos(int num,int pos)
{
node*newnode;
newnode=(node*)malloc(sizeof(node));
newnode->left=NULL;
newnode->info=num;
newnode->right=NULL;
if(start==NULL)
start=last=newnode;
else
{
node*temp=start;
node*prev=NULL;
int i=1;
while(i<=pos-1)
{
prev=temp;
temp=temp->right;
i++;
}
newnode->right=prev->right;
newnode->left=prev;
prev->right=newnode;
temp->left=newnode;
}
}
void delete_beg()
{
node*temp;
if(start==NULL)
cout<<"empty list";
else
{
temp=start;
start->right->left=NULL;
start=start->right;
free(temp);
}
}
void delete_end()
{
node*temp;
if(start==NULL)
cout<<"empty list";
else
{
temp=last;
temp->left->right=NULL;
last=temp->left;
free(temp);
}
}
void delete_pos(int pos)
{
node*temp,*prev;
if(start==NULL)
cout<<"empty list";
else
{
prev=NULL;
int i=1;
temp=start;
while(i<=pos-1)
{
prev=temp;
temp=temp->right;
i++;
}
prev->right=temp->right;
temp->right->left=prev;
free(temp);
}
}
void display_front()
{
node*temp;
if(start==NULL)
cout<<"empty list";
else
{
temp=start;
while(temp!=NULL)
{
cout<<temp->info<<"<->";
temp=temp->right;
}
}
}
void display_back()
{
node*temp;
if(start==NULL)
cout<<"empty list";
else
{
temp=last;
while(temp!=NULL)
{
cout<<temp->info<<"<->";
temp=temp->left;
}
}
}
int main()
{
int num,choice,pos;
while(1)
{
cout<<"\n***************** MENU ********************"<<endl;
cout<<"1.insert at beginning"<<endl;
cout<<"2.insert at end"<<endl;
cout<<"3.insert at given position"<<endl;
cout<<"4.delete from beginning"<<endl;
cout<<"5.delete from end"<<endl;
cout<<"6.delete from given position"<<endl;
cout<<"7.search an element"<<endl;
cout<<"8.sort the list"<<endl;
cout<<"9.forward display"<<endl;
cout<<"10.backward display"<<endl;
cout<<"11.exit"<<endl;
cout<<"enter your choice : "<<endl;
cin>>choice;
switch(choice)
{
case 1:
cout<<"enter number to insert : ";
cin>>num;
insert_beg(num);
break;
case 2:
cout<<"enter number to insert : ";
cin>>num;
insert_end(num);
break;
case 3:
cout<<"enter number to insert : "<<endl;
cin>>num;
cout<<"enter position : ";
cin>>pos;
insert_pos(num,pos);
break;
case 4:
delete_beg();
break;
case 5:
delete_end();
break;
case 6:
cout<<"enter position : ";
cin>>pos;
delete_pos(pos);
break;
case 9:
display_front();
break;
case 10:
display_back();
break;
case 11:
exit(0);
default:
cout<<"invalid input";
break;
}
}
return 0;
}