链栈
栈空的条件:s->next=NULL栈满的条件:不考虑进栈操作:将包含e的结点插入到头节点之后退栈操作:取出头节点之后节点的元素并删除
###代码块
1234567typedef struct linknode{ ElementType data; struct linknode *next;}LiStack;
/初始化/12345void (LiStack *&s){ s=(LiStack *)malloc(sizeof(LiStack)); s->next=NULL;}
/销毁栈/1234567891011void DestroyStack (LiStack *&s){ LiStack *p=s,*q=s->next; while(q!=NULL) {
...