forked from Algo-Phantoms/Algo-Tree
-
Notifications
You must be signed in to change notification settings - Fork 0
/
LinkedList_MenuDrivenProgram.cpp
183 lines (179 loc) · 2.72 KB
/
LinkedList_MenuDrivenProgram.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
#include <iostream>
using namespace std;
typedef struct sll
{
int data;
struct sll*next;
}node;
node *head;
void create()
{
node *temp=NULL, *ne;
char ch;
int no;
do
{
ne=new node;
cout << "Enter number:" << endl;
cin >> no;
ne->data=no;
ne->next=NULL;
if(head==NULL)
{
head=ne;
temp=ne;
}
else
{
temp->next=ne;
temp=ne;
}
cout << "Any other node y or n:" << endl;
cin >> ch;
}while(ch=='y');
}
void display()
{
node *temp;
temp=head;
if(temp==NULL)
cout << "NULL" << endl;
else
{
while(temp!=NULL)
{
cout << " " << temp->data;
temp=temp->next;
}
}
}
void inserthead()
{
node *new1;
new1 = new node;
cout << "Enter data for new node:" << endl;
cin >> new1->data;
new1->next = NULL;
new1->next = head;
head = new1;
}
void insertlast()
{
node *new1, *temp;
new1 = new node;
cout << "Enter data for new node:" << endl;
cin >> new1->data;
new1->next = NULL;
temp = head;
while(temp->next!=NULL)
{
temp = temp->next;
}
temp->next = new1;
}
void insertafter()
{
int p;
cout << "Enter the position to added:" << endl;
cin >> p;
node *new1 = new node;
cout << "Enter data for new node:" << endl;
cin >> new1->data;
new1->next = NULL;
node *temp = head;
for(int i=0;i<p;i++)
{
temp = temp->next;
}
new1->next = temp->next;
temp->next = new1;
}
void search()
{
node *temp;
int key, flag=0;
temp = head;
cout << "Enter the key no to be search:" << endl;
cin >> key;
while(temp!=NULL)
{
if(temp->data == key)
{
flag = 1;
break;
}
temp = temp->next;
}
if(flag == 1)
cout << "Match is found" << endl;
else
cout << "Match is NOT found" << endl;
}
void delete_head()
{
node *temp;
temp = head;
head = head->next;
delete temp;
}
void delete_tmp()
{
node *temp, *tail;
temp = head;
while(temp->next!=NULL)
{
tail = temp;
temp = temp->next;
}
tail->next = NULL;
delete temp;
}
void delete_position()
{
int p;
cout << "Enter position to be deleted" << endl;
cin >> p;
node *temp, *current;
current = head;
for(int i=0; i<p; i++)
{
temp = current;
current = current->next;
}
temp->next = current->next;
delete current;
}
int main()
{
int c;
char che;
do
{
cout << " choice 1:Create 2:display 3:insert_head 4:insert_last 5:insert_after 6:search 7:delete_head 8:delete_tmp 9:delete_at_particular_position " << endl;
cout << "Enter your choice:" << endl;
cin >> c;
switch(c)
{
case 1: create();
break;
case 2: display();
break;
case 3: inserthead();
break;
case 4: insertlast();
break;
case 5: insertafter();
break;
case 6: search();
break;
case 7: delete_head();
break;
case 8: delete_tmp();
break;
case 9: delete_position();
}
cout << "do you want to continue y or n:" << endl;
cin >> che;
}while(che=='y');
return 0;
}