1.链栈结构

typedef struct StackNode{        SElemType data;        struct StackNode *next;}StackNode,*LinkStackPtr;typedef struct{        LinkStackPtr top;        int count;}LinkStack;

2.构造一个空栈S

Status InitStack(LinkStack *S){         S->top = (LinkStackPtr)malloc(sizeof(StackNode));        if(!S->top)                return ERROR;        S->top=NULL;        S->count=0;        return OK;} 

3. 把S置为空栈

Status ClearStack(LinkStack *S){         LinkStackPtr p,q;        p=S->top;        while(p)        {                  q=p;                p=p->next;                free(q);        }         S->count=0;        return OK;}

4. 若栈S为空栈，则返回TRUE，否则返回FALSE

Status StackEmpty(LinkStack S){         if (S.count==0)                return TRUE;        else                return FALSE;}

5. 返回S的元素个数，即栈的长度

int StackLength(LinkStack S){         return S.count;}

6.若栈不空，则用e返回S的栈顶元素，并返回OK；否则返回ERROR

Status GetTop(LinkStack S,SElemType *e){        if (S.top==NULL)                return ERROR;        else                *e=S.top->data;        return OK;}

7. 插入元素e为新的栈顶元素

Status Push(LinkStack *S,SElemType e){        LinkStackPtr s=(LinkStackPtr)malloc(sizeof(StackNode));         s->data=http://www.mamicode.com/e; >

 

8.若栈不空，则删除S的栈顶元素，用e返回其值，并返回OK；否则返回ERROR 
Status Pop(LinkStack *S,SElemType *e){         LinkStackPtr p;        if(StackEmpty(*S))                return ERROR;        *e=S->top->data;        p=S->top;					/* 将栈顶结点赋值给p，见图中③ */        S->top=S->top->next;    /* 使得栈顶指针下移一位，指向后一结点，见图中④ */        free(p);                    /* 释放结点p */                S->count--;        return OK;}

9.显示全部数据
Status StackTraverse(LinkStack S){        LinkStackPtr p;        p=S.top;        while(p)        {                 visit(p->data);                 p=p->next;        }        printf("\n");        return OK;}

 
Status visit(SElemType c){        printf("%d ",c);        return OK;}

 
 
 
 
 
 
 
 
 
 
 
 
参考<<大话数据结构>>