链栈的入栈与出栈

前言

本文将介绍链栈的入栈与出栈的操作。

输入描述

整数n

n个元素

输出描述 

 n个元素按出栈顺序输出

具体代码 

#include<iostream>
#include<fstream>
using namespace std;

#define OK 1
#define ERROR 0
#define OVERFLOW -2
typedef int Status;
typedef char SElemType;

typedef struct StackNode {
SElemType data;
struct StackNode *next;
} StackNode, *LinkStack;
Status Push(LinkStack &S, SElemType e);
Status Pop(LinkStack &S, SElemType &e);

//算法　链栈的初始化
Status InitStack(LinkStack &S) { // 构造一个空栈 S，栈顶指针置空
S = NULL;
return OK;
}

int main() {
LinkStack s,p;
int n,i;
SElemType x,t;
InitStack(s); 
cin>>n;
for(i=0;i<n;i++)
{
    cin>>x;
    Push(s,x);
}
//出栈   
while(Pop(s,t))
    {
    cout<<t<<endl;    
}
return 0;
}
//算法　链栈的入栈
Status Push(LinkStack &S, SElemType e) {//在栈顶插入元素e
LinkStack p;
p = new StackNode; //生成新结点
p->data = e; //将新结点数据域置为e
p->next = S; //将新结点插入栈顶
S = p; //修改栈顶指针为p
return OK;
}

//链栈出栈
Status Pop(LinkStack &S, SElemType &e)
{
    LinkStack x;
    //判断链表是否为空表
    if(S == NULL)
        return ERROR;
    else
        e = S->data;
        x = S;
        S = S->next;
        delete x;
    return OK;

}

输入样例 

3
A
B
C

输出样例 

C
B
A

总结 

链栈的入栈与出栈就相当于链表的尾插和倒向输出。