-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path26.cpp
More file actions
124 lines (104 loc) · 1.96 KB
/
26.cpp
File metadata and controls
124 lines (104 loc) · 1.96 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
/*
@Author: Amritanshu Sikdar
Session: 2018-'19
Repository: https://github.com/amritanshusikdar/CS30PracticalQuestion
*/
// Program to store city names in a queue and access data using a menu
#include <constream.h>
#include <stdio.h>
#include <stdlib.h>
struct node
{
char city[20];
node *link;
};
class queue
{
private:
node *front, *rear;
public:
queue() { front = rear = NULL; }
void add();
void del();
void view();
~queue();
};
void queue::add()
{
node *temp = new node;
gets(temp->city);
temp->link = NULL;
if(rear == NULL)
rear = front = temp;
else
{
rear->link = temp;
rear = temp;
}
}
void queue::del()
{
if(front == NULL)
cout << "Underflow!!!\n";
else
{
node *ptr = front;
front = front->link;
delete ptr;
if(front == NULL)
rear = NULL;
}
}
void queue::view()
{
node *temp = front;
while(temp!=NULL)
{
cout << temp->city << "-->";
temp = temp->link;
}
cout << "!!!\n";
}
queue::~queue()
{
node *temp;
while(front != NULL)
{
temp = front;
front = front->link;
delete temp;
}
}
void main()
{
clrscr();
int ch;
queue qt;
while(1)
{
cout << "Menu:\n1. Add\n2. Delete\n3. View\n4. Exit\n";
cout << "Choice: ";
cin >> ch;
switch (ch)
{
case 1:
cout << "Enter city: ";
qt.add();
break;
case 2:
qt.del();
cout << "City deleted!\n";
break;
case 3:
qt.view();
break;
case 4:
cout << "Closing program!";
getch();
return;
default:
cout << "Invalid option!\n";
break;
}
}
}