-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathStack.cpp
More file actions
117 lines (93 loc) · 1.66 KB
/
Stack.cpp
File metadata and controls
117 lines (93 loc) · 1.66 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
#include "stdafx.h"
#include <iostream>
using namespace std;
struct node{
int data;
node *next;
};
node *top;
class stack{
public:
stack()
{
top = NULL;
}
node* push(node*, int);
node* pop(node*);
void traverse(node*);
};
node* stack::push(node *top, int value)
{
node* temp = new node;
temp->data = value;
temp->next = top;
top = temp;
return top;
}
node* stack::pop (node *top){
node *temp = new node;
if(top == NULL)
{
cout<<"Stack is empty "<<endl;
}
else
{
temp = top;
top = top->next;
free(temp);
}
return top;
}
void stack::traverse(node *top){
node *temp = new node;
temp = top;
if(top == NULL)
{
cout<<"Stack is empty "<<endl;
}
else
{
while (top != NULL)
{
cout << temp->data <<endl;
temp = temp->next;
}
}
}
int main(){
int choice, item;
stack sl;
while (1)
{
cout<<"\n-------------"<<endl;
cout<<"Operations on Stack"<<endl;
cout<<"\n-------------"<<endl;
cout<<"1.Push Element into the Stack"<<endl;
cout<<"2.Pop Element from the Stack"<<endl;
cout<<"3.Traverse the Stack"<<endl;
cout<<"4.Quit"<<endl;
cout<<"Enter your Choice: ";
cin>>choice;
switch(choice)
{
case 1:
cout<<"Enter value to be pushed into the stack: ";
cin>>item;
top = sl.push(top, item);
break;
case 2:
top = sl.pop(top);
break;
case 3:
sl.traverse(top);
break;
case 4:
exit(1);
break;
default:
cout<<"Wrong Choice"<<endl;
}
}
return 0;
getchar();
}