【无标题】堆栈……

#include <stdio.h>
#include <string.h>
#define Maxsize 100
typedef struct SNode*Stack;
struct SNode{
    int Data[Maxsize];
    int Top;
};
//入栈
void Push(Stack ptrs,int item){
    if(ptrs->Top==Maxsize-1){
        printf("堆栈满");return;
    }
    else{
        ptrs->Data[++(ptrs->Top)]=item;
        return;
    }
}
//出栈
int pop(Stack ptrs){
    if(ptrs->Top==-1){
        printf("堆栈空");
        return ERROR;//error是elementType的特殊值，标志错误
    }else
        return(ptrs->Data[(ptrs->Top)--]);
}