链栈

链栈，写起来还是不熟

#include <iostream>
#include <cstdlib>
using namespace std;
typedef struct node 
{
    int data;
    struct node* next;
}stacknode,*linkstack;
void initstack(linkstack *s)
{
    *s=new stacknode;
    (*s)->next=NULL;
}
bool stackempty(linkstack s)
{
    if(s->next==NULL)
        return 1;
    return 0;
}
void pushstack(linkstack s,int e)
{
    linkstack p;
    p=new stacknode;
    p->data=e;
    p->next=s->next;
    s->next=p;
}
void popstack(linkstack s)
{
    linkstack p;
    p=s->next;
    if(stackempty(s))
        cout<<"栈空"<<endl;
    else
    {
        s->next=p->next;
        free(p);
    }
}
void getstack(linkstack s)
{
    if(stackempty(s))
        cout<<"空栈";
    else
    {
        cout<<(s->next)->data<<" ";
    }
}
int main()
{    
    int i;
    linkstack s;
    initstack(&s);
    for(i=0;i<5;i++)
        pushstack(s,i);
    for(i=0;i<5;i++)
    {
        getstack(s);
        popstack(s);
    }
}