顺序栈基本操作模拟系统

#include<stdio.h>
#include<stdlib.h>
#define MAXSIZE 10
#define OK 1
#define ERROR 0
typedef short SElemType;
typedef short Status;
struct SqStack
{
    SElemType *base;/* 栈底指针 */
    SElemType *top; /* 栈顶指针 */
    short stacksize;/* 栈可用的最大容量 */
};
/* */
Status InitStack(struct SqStack* s);
Status Push(struct SqStack* &s, SElemType e);
Status Pop(struct SqStack* &s, SElemType &e);
Status GetTop(struct SqStack* &s, SElemType &e);
Status ClearStack(struct SqStack* &s);
Status Traverse(struct SqStack* &s);
void MenuPrint();
/* */
int main()
{
    short choice;
    SElemType e;
    struct SqStack stackNode;
    struct SqStack *s = &stackNode;
    InitStack(s);/* 初始化顺序栈 */
    MenuPrint();
    while(1)
    {
        printf("Please input your choice : ");
        while(scanf("%hd", &choice) != 1 || choice < 1 || choice > 6)
        {
            while(getchar() != '\n') ;