-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathstack
More file actions
112 lines (100 loc) · 1.41 KB
/
stack
File metadata and controls
112 lines (100 loc) · 1.41 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
#pragma once
#include <iostream>
using namespace std;
class BasicError
{
};
enum stacktype { Full, Empty };
class StackError : public BasicError
{
public:
stacktype error;
StackError(stacktype errors)
{
error = errors;
}
};
template<class t>
class Stack
{
private:
t dataarray[5];
int top;
int stack;
public:
Stack()
{
top = 0;
for (int x = 0; x < 5; x++)
{
dataarray[x] = NULL;
}
}
Stack(int size)
{
stack = size;
}
void push(t item)
{
char Choice = 0;
try {
if (top == 5)
{
throw new StackError(stacktype::Full);
}
else
{
dataarray[top] = item;
top = top + 1;
}
}
catch (StackError * e)
{
if (e->error == stacktype::Full)
{
cout << "******Stack is Full******" << endl;
cout << "A) Throw away new item" << endl;
cout << "B) Throw away top item" << endl;
cout << "C) Throw away bottom item" << endl;
cout << "Please enter a choice ";
cin >> Choice;
switch (Choice)
{
case 'A': case 'a':
{
}
break;
case 'B': case 'b':
{
dataarray[top - 1] = item;
}
break;
case 'C': case 'c':
{
RemoveItemFromBottom();
dataarray[top] = item;
top = top + 1;
}
}
}
}
}
t Pop()
{
t Temp;
if (top > 0)
{
Temp = dataarray[top - 1];
top--;
return Temp;
}
else
{
throw new StackError(stacktype::Empty);
}
}
bool empty()
{
return !top;
}
};