-
Notifications
You must be signed in to change notification settings - Fork 0
/
Stack.cpp
78 lines (67 loc) · 1.24 KB
/
Stack.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
#include <iostream>
#define MAX 5
using namespace std;
class Stack
{
private:
int top;
char elements[MAX];
public:
Stack()
{
top = -1;
}
bool isEmpty()
{
return (top == -1);
}
bool isFull()
{
return (top == MAX - 1);
}
void push(char c)
{
if (!isFull())
{
top++;
elements[top] = c;
cout << c << " pushed to Stack!\n";
}
else
{
cout << "Stack is Full! Cannot Push " << c << " to the Stack!\n";
}
}
void pop()
{
if (!isEmpty())
{
cout << elements[top] << " popped from Stack!\n";
top--;
}
else
{
cout << "Stack is Empty! Cannot Pop!\n";
}
}
char topElement()
{
return elements[top];
}
};
int main()
{
Stack myStack;
string message = "PYTHON";
for (char letter : message)
{
myStack.push(letter);
}
cout << "Top of Stack is " << myStack.topElement() << endl;
while (!myStack.isEmpty())
{
myStack.pop();
}
myStack.pop();
return 0;
}