链栈的基本操作

有问题欢迎大家指出

#include <iostream>

using namespace std;

typedef struct SNode
{
    int data;
    struct SNode *next;

    SNode(): next(NULL) {}
    SNode(int _data):data(_data),next(NULL){}
} *LinkStack;

void InitStack(LinkStack &s)
{
    s = new SNode(-1); //头节点
    s->next = NULL;
}

//判断栈空
bool StackEmpty(LinkStack s)
{
    if(s->next == NULL) return true;
    return false;
}

//入栈
void PushStack(LinkStack &s, int e)
{
    SNode *p = new SNode(e);
    SNode *top = s;
    p->next = top->next;
    top->next = p;
}

//出栈
void PopStack(LinkStack &s)
{   
    if(!StackEmpty(s))
    {
        SNode *p = s->next;
        s->next = p->next;
        cout << p->data << endl;
        delete(p);
    }

}

//栈的长度
int StcakLength(LinkStack s)
{   
    int length = 0;
    SNode *p = s->next;
    while(p)
    {
        length ++;
        p = p->next;
    }
    return length;
}

//输出
void Output(LinkStack s)
{
    SNode *p = s->next;
    while(p)
    {
        cout << p->data << " ";
        p = p->next;
    }
    cout << endl;
}

int main()
{
    LinkStack s;
    InitStack(s);

    for(int i = 0; i < 10; i ++)
        PushStack(s, i);
    cout << StcakLength(s);

    cout << "---------------" << endl;
    Output(s);
    PushStack(s, 100);
    Output(s);
    PopStack(s);
    PopStack(s);PopStack(s);PopStack(s);PopStack(s);PopStack(s);PopStack(s);
    PopStack(s);PopStack(s);PopStack(s);PopStack(s);
    cout << StcakLength(s);

    cout << "---------------" << endl;
    if(StackEmpty(s))
        cout << "k" << endl;
    else 
        cout << "bk" << endl;

    return 0;
}