单链表实现栈

#include <stdio.h>
#include <stdlib.h>
#define maxsize 100
typedef int ElemType;
typedef struct StackNode {
    ElemType data;
    struct StackNode* next;
}StackNode,*LinkStack;
LinkStack S;
void InitStack(LinkStack& S) {
    S = NULL;
}
int StackEmpty(LinkStack& S) {
    if (S == NULL)return 1;
    return 0;
}
int Push(LinkStack& S, ElemType e) {
    StackNode* p = (StackNode*)malloc(sizeof(struct StackNode));
    p->data = e;
    p->next = S;
    S = p;
    return 1;
}
int Pop(LinkStack& s, ElemType& e) {
    if (s == NULL)return 0;
    e = s->data;
    StackNode* p = s;
    s = s->next;
    free(p);
    return 1;
}
ElemType GetTop(LinkStack s) {
    if (s == NULL)return 0;
    return s->data;
}