栈ADT链表实现的生命
#ifdef
struct Node;
typedef struct Node * PtrToNode;
typedef PtrToNode Stack;
int IsEmpty (Stack S);
Stack CreateStack (void);
void DisposeStack (Stack S);
void MakeEmpty (Stack S);
void Push (SlementType X, Stack S);
#ifdef
struct Node;
typedef struct Node * PtrToNode;
typedef PtrToNode Stack;
int IsEmpty (Stack S);
Stack CreateStack (void);
void DisposeStack (Stack S);
void MakeEmpty (Stack S);
void Push (SlementType X, Stack S);