链栈的表示和实现

链栈的表示和实现

--------------链栈的存储结构--------------

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

①初始化

Status InitStack(LinkStack &S)
{
   S=NULL;
   return OK;
}

②入栈

Status Push(LinkStack &S,SElemType e)
{
    p=new StackNode;
    p->data=e;       //将新节点的数据域置为e
    p->next=S;   //将新节点插入到栈顶
    S=P;    //修改栈顶指针为p
}

③出栈

Status Pop(LinkStack &S,SElemType &e)
{
    if(S=NULL)   return ERROR;
    e=S->data;
    p=S;
    S=S->next;    //修改栈顶指针
    delete p;     //释放原栈顶元素的空间
    return OK;
    
}

④取栈顶元素

SElemType GetTop(LinkStack &S)
{
     if(S=NULL)   return ERROR;
     return S->data;    //返回栈顶元素栈顶指针不变
}