数据结构-链栈

#include <iostream>
#include <stdlib.h>
using namespace std;

typedef struct LNode
{
    int data;
    struct LNode *next;
}LNode;//栈结点定义

void InitStack(LNode *&S)
{
    S=(LNode*)malloc(sizeof(LNode));
    S->next=NULL;
}

int IsEmpty(LNode *S)
{
    if(S->next==NULL)
        return 1;
    else
        return 0;
}

void Push(LNode *&S,int e)
{
    LNode *p;
    p=(LNode*)malloc(sizeof(LNode));
    p->next=NULL;
    p->data=e;

    p->next=S->next;
    S->next=p;
}

int Pop(LNode *&S,int &e)
{
    LNode *p;
    if(S->next==NULL)
        return 0;

    p=S->next;
    e=p->data;
    S->next=p->next;
    free(p);
    return 1;
}

void Print(LNode *S)
{
    if(S->next==NULL)
    {
        cout<<"链栈为空！ "<<endl;
        return;
    }
    LNode *p;
    p=S->next;
    cout<<"
链栈中的元素为（栈顶->栈底）:
";
    while(p!=NULL)
    {
        cout<<"  "<<p->data<<"  ";
        p=p->next;
    }
    return;
}

int main()
{
    int i,e;
    LNode *S;
    InitStack(S);
    for(i=0;i<10;++i)
        Push(S,i);
    Print(S);


    cout<<"

依次出栈的四个元素为:
";
    for(i=0;i<4;++i)
    {
        Pop(S,e);
        cout<<"  "<<e<<"  ";
    }
    //cout<<"

";
    Print(S);
    if(IsEmpty(S)==1)
        cout<<"
此时，链栈为空！
";
    else
        cout<<"
此时，链栈非空！
";

    return 0;
}