-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathStack.cpp
98 lines (67 loc) · 1.43 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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
#include<iostream>
#include "Stack.h"
#include "Logger.h"
template <class T>
Stack<T>::~Stack()
{
logger("Stack destructor called...");
delete [] this->Array;
}
template <class T>
Stack<T>::Stack(int Size)
{
logger("Stack constructor called...");
this->Array=new T[Size];
this->Capacity=Size;
Top=-1;
}
template <class T>
bool Stack<T>::push(T X)
{
if(this->Top>=(this->Capacity-1))
{
std::cout << "Stack overflow!";
logger("Stack overflow!");
return false;
}
else
{
this->Array[++Top]=X;
return true;
}
}
template <class T>
T Stack<T>::pop()
{
if(this->Top<0)
{
std::cout << "Stack underflow!";
logger("Stack underflow!");
return (T)0;
}
else
{
T X=this->Array[Top--];
return X;
}
}
template <class T>
T Stack<T>::top()
{
if(this->Top<0)
{
std::cout << "Stack is empty!";
logger("Stack is empty!");
return (T)0;
}
else
{
T X=this->Array[Top];
return X;
}
}
template <class T>
bool Stack<T>::empty()
{
return (this->Top<0);
}