链栈

//链栈
typedef struct LinkStack1{
    int data;
    struct LinkStack1 *next;
}StackNode,*LinkStack; 

//初始化
bool InitStack(LinkStack &S){
    S=(LinkStack)malloc(sizeof(StackNode));
    S=NULL;
    return true;
} 
//进栈
bool Push(LinkStack &S,int x){
    StackNode *m;
    m=(StackNode *)malloc(sizeof(StackNode));
    m->data=x;
    m->next=S;
    S=m;
    
    return true;
} 
//出栈
bool Pop(LinkStack &S,int &x){
    LinkStack L;
    L=S;
    x=L->data;
    S=L->next;
    free(L);
    return true;
} 
//遍历
bool travel(LinkStack S){
    LinkStack Q;
    Q=S;
    while(Q!=NULL){
        printf("%d",Q->data);
        Q=Q->next;
    }
    return true;
} 
int main(){
    LinkStack S;
    int x;
    InitStack(S);
    Push(S,1);
    Push(S,2);
    Push(S,5);
    Pop(S,x);
    travel(S);
    printf("\n");
    printf("%d",x);
    return 0;
}