forked from iharsh234/Algo_Ds_Notes
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Stacks.cpp
89 lines (70 loc) · 1.25 KB
/
Stacks.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
#include <iostream>
using namespace std;
class stack
{
int *array;
int tos;
int size;
public:
stack()
{
size = 10;
array = new int[size];
tos = -1;
}
stack(int size)
{
this -> size = size;
array = new int[size];
tos = -1;
}
void push(int value)
{
if(tos == size - 1)
cout << "Stack is full" << endl;
else
array[++tos] = value;
}
void pop()
{
if(tos == -1)
cout << "Stack is empty" << endl;
else
--tos;
}
void traverse()
{
int temp = tos - 1;
if(tos == -1)
cout << "Stack is empty" << endl;
else
{
cout << "Top of stack is : " << array[tos] << endl;
if(temp > -1)
cout << "Other : ";
while(temp > -1)
cout << array[temp--] << " ";
cout << endl;
}
}
};
int main()
{
stack st(5);
for(int i = 0; i < 6; i++)
{
st.push(i);
}
st.traverse();
for(int i = 0; i < 6; i++)
{
st.pop();
}
return 0;
}
/* Output
Stack is full
Top of stack is : 4
Other : 3 2 1 0
Stack is empty
*/