C++ 堆栈

class seqstack//头文件
{
public:
int *data;
int top;
int maxsize;
public:
seqstack(int mx)
{
top=-1;
maxsize=mx;
data=new int[maxsize];
}
bool isempty();//是否为空
void push(int value);//入栈
void pop();//出栈
int gettop();//取顶点元素
bool isfull();//是否已满
};

#include"iostream.h"
#include"stdlib.h"
bool seqstack::isempty()
{
if(top==-1)
return 1;
return 0;
}
bool seqstack::isfull()
{
if(top==maxsize-1)
return 1;
return 0;
}
void seqstack::push(int value)
{
if(seqstack::isfull())
{
cout<<"the stack is full"<<endl;
abort();
}
top++;
data[top]=value;
}
void seqstack::pop()
{
if(seqstack::isempty())
{
cout<<"the stack is empty"<<endl;
abort();