一.顺序栈
1.1顺序栈的存储结构
#define MAXSIZE 100
typedef struct{
SElemType *base;
SElemType *top;
int stacksize;
}SqStack;
1.2顺序栈的初始化
Status InitStack(SqStack &S){
S.base=new SElemType[MAXSIZE];
if(!S.base) exit(OVERFLOW);
S.top=S.base;
S.stacksize=MAXSIZE;
return OK;
}
1.3顺序栈的入栈和出栈
顺序栈的入栈操作:
Status Push(SqStack &S.SElemType e){
if(S.top-S.base==S.stacksize) return ERROR;
*S.top++=e;
return OK;
}
顺序栈的出栈操作:
Status Pop(SqStack &S,SElemType &e){
if(S.top==S.base) return ERROR;
e=*--S.top;
return OK;
}
1.4取栈顶元素
SElemType GetTop(SqStack S){
if(S.top!=S.base)
return *(S.top-1);
}
二.链栈
2.1链栈的存储结构
typedef struct StackNode{
ElemType data;
struct StackNode *next;
}StackNode,*LinkStack;
2.2链栈的初始化
Status InitStack(LinkStack &S){
S=NULL;
return OK;
}
2.3链栈的入栈和出栈
链栈的入栈操作:
Status Push(LinkStack &S,SElemType e){
p=new StackNode;
p->data=e;
p->next=S;
S=p;
return OK;
}
链栈的出栈操作:
Status Pop(LinkStack &S,SElemType &e){
if(S==NULL) return ERROR;
e=S->data;
p=S;
S=S->next;
delete p;
return OK;
}
2.4取栈顶元素
SElemType GetTop(LinkStack S){
if(S!=NULL){
return S->data;
}
}