(六) 栈的链式存储结构

1、存储结构

typedef struct StackNode
{
      ElemType data;	// 存放栈的数据
     struct StackNode *next;
} StackNode, *LinkStackPtr;
typedef struct LinkStack
{
     LinkStackPrt top;// top指针
     int count;	// 栈元素计数器
}

2、进栈操作

对于栈链的Push操作，假设元素值为e的新结点是s，top为栈顶指针

Status Push(LinkStack *s, ElemType e)
{
    LinkStackPtr p = (LinkStackPtr) malloc (sizeof(StackNode));
    p->data = e;
    p->next = s->top;
    s->top = p;
    s->count++;
    return OK;
}

3、出栈操作

链栈的出战Pop操作，假设变量p用来存储要删除的栈顶结点，将栈顶指针下移一位，最后释放p即可。

Status Pop(LinkStack *s, ElemType *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;
}