栈的C++语言实现

#include <iostream>
using namespace std;
#define MAX_SIZE 100   // 存储空间初始分配量
#define OK 1
#define ERROR -1
typedef int Status;  
typedef int elemtype;
class Stack
{
private:
elemtype stck[MAX_SIZE];
int top;  // 栈顶位置
public:
Stack();
~Stack();
bool stackEmpty();
int stackLength();
Status getTop(elemtype &elem);
Status push(elemtype elem);
Status pop();
void stackTravel();
};
Stack::Stack()
{
top = -1;
}
Stack::~Stack()
{
top = -1;
}
bool Stack::stackEmpty()
{
if (-1 == top)  return true;
else  return false;
}
int Stack::stackLength()
{
return top+1;
}
Status Stack::getTop(elemtype &elem)
{
if (stackEmpty())
return ERROR;
else
{
elem=stck[top];
return OK;
}
}
Status Stack::push(elemtype elem)
{
if (MAX_SIZE - 1 == top)
{
cout << "\n栈满，无法添加\n";
return ERROR;
}
else
{
stck[++top] = elem;
return OK;
}
}
Status Stack::pop()
{
if (stackEmpty())
{
cout << "栈空，没有元素可以删除\n";
return ERROR;
}
else
{
top--;
return OK;
}
}
void Stack::stackTravel()
{
if (stackEmpty())
{
cout << "\n栈遍历为空\n";
return;
}
else
{
cout << "栈中所有数据如下：\n";
for (int i = 0; i <= top; i++)
{
cout << stck[i] << " ";
}
}

}

/*测试*/

int main()
{
Stack s;
cout << "此时执行了100次入栈操作\n";
for (int i = 1; i <=100; i++)
{
s.push(i);
}
s.stackTravel();
s.push(101);
cout << "此时执行了100次出栈操作\n";
for (int i = 0; i < 100; i++)
{
s.pop();
}
s.stackTravel();
s.pop();
return 0;
}