-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathweek7b.cpp
More file actions
141 lines (129 loc) · 2.65 KB
/
week7b.cpp
File metadata and controls
141 lines (129 loc) · 2.65 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
#include<bits/stdc++.h>
using namespace std;
class Node{
public:
int data;
Node *next;
Node *prev;
};
Node *newnode, *head, *temp,*temp2;
void insertBeg(){
newnode = new Node();
int data;
cin>>data;
newnode->data=data;
if(head==NULL){
newnode->next=NULL;
newnode->prev=NULL;
head=newnode;
}
else{
newnode->prev=NULL;
newnode->next=head;
head=newnode;
}
}
void insertEnd(){
newnode=new Node();
int data;
cin>>data;
newnode->data=data;
if(head==NULL){
newnode->next=NULL;
newnode->prev=NULL;
head=newnode;
}
temp=head;
while(temp->next!=NULL) temp=temp->next;
newnode->next=NULL;
newnode->prev=temp;
temp->next=newnode;
}
void insertSpec(){
int val;
cout<<"Enter the value after which node has to be inserted";
cin>>val;
int data;
cin>>data;
newnode= new Node();
newnode->data=data;
temp=head;
while(temp->data!=val) temp=temp->next;
newnode->next=temp->next;
temp2=temp->next;
temp2->prev=newnode;
newnode->prev=temp;
temp->next=newnode;
}
void delete_beg(){
if(head==NULL) cout<<"List is empty\n";
else{
head=head->next;
head->prev=NULL;
cout<<"Element deleted\n";
}
}
void delete_end(){
if(head==NULL) cout<<"List is empty\n";
else{
temp=head;
while(temp->next!=NULL) {
temp2=temp;
temp=temp->next;
}
temp2->next=NULL;
cout<<"Element deleted\n";
}
}
void deletespec(){
if(head==NULL) cout<<"List is empty\n";
else{
cout<<"Enter the node to be deleted\n";
int val;
cin>>val;
while(temp->data!=val) temp=temp->next;
temp->prev->next=temp->next;
temp->next->prev=temp->prev;
}
}
void display(){
temp=head;
while(temp->next!=NULL){
cout<<temp->data<<"-->";
temp=temp->next;
}
cout<<temp->data<<endl;
}
int main (){
int choice;
while(1){
cout<<"\n1.Insert at beginning\n2.Insert after specific node\n3.Insert at end\n4.delete at beginning\n5.Delete at end\n6.delete a specific node\n7.Display\n8.ReverseDisplay\n9.Exit\n";
cout<<"Enter your choice\n";
cin>>choice;
switch(choice){
case 1:
insertBeg();
break;
case 3:
insertEnd();
break;
case 2:
insertSpec();
break;
case 4:
delete_beg();
break;
case 5:
delete_end();
break;
case 6:
deletespec();
break;
case 7:
display();
break;
case 8:
exit(0);
}
}
}