数据结构 链栈的基本操作

#include <stdio.h>

#define OK         1
#define ERROR      0
#define OVERFLOW   -2

typedef int SElemType;

typedef struct StackNode
{
SElemType data;
struct StackNode *next;
}StackNode, *LinkStackPtr;

typedef struct LinkStack
{
LinkStackPtr top;
int count;
}LinkStack;

int Push(LinkStack &S, SElemType e)
{
LinkStackPtr s = (LinkStackPtr) malloc(sizeof(StackNode));
s->data = e;
s->next = S.top;
S.top = s;
S.count++;
return OK;
}

int Pop(LinkStack &S, SElemType &e)
{
LinkStackPtr p;
if (stackEmpty(S))
return ERROR;
e = S.top ->data ;
p = S.top ;
S.top = S.top ->next ;
free(p);
S.count --;
return OK;
}