栈的链式存储结构以及实现

#include "stdafx.h"
#include <iostream>
#include <exception>
using namespace std;

//栈的链式存储结构及实现
//栈的结构定义
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
typedef int sElemType;
typedef int Status;


typedef struct StackNode
{
    sElemType data;
    struct StackNode *next;
}StackNode,*LinkStackPtr;

typedef struct LinkStack
{
    LinkStackPtr top;
    int count;
}linkStack;

//栈空
Status StackEmpty(LinkStack *S)
{
    if(S->count == 0)
    {
        return TRUE;
    }
    else
    {
        return FALSE;
    }

}
//入栈
Status Push(LinkStack *S,sElemType e)
{
    LinkStackPtr s = (LinkStackPtr)malloc(sizeof(StackNode));
    s->data = e;
    s->next = S->top;
    S->top = s;
    S->count++;
    return OK;
}
//出栈
Status Pop(LinkStack *S,sElemType *e)
{
    if(StackEmpty(S))
    {
        cout<<"栈空"<<endl;
        return ERROR;
    }
    LinkStackPtr p = S->top;
    S->top = p->next;
    *e = p->data;
    free(p);
    S->count--;
    return OK;
}


int _tmain(int argc, _TCHAR* argv[])
{
    int pushElem = 2;
    linkStack *linkSt=(linkStack*)malloc(sizeof(LinkStack));
    linkSt->count=0;
    Push(linkSt,pushElem);//将2入栈
    pushElem = 3;
    Push(linkSt,pushElem);//将3入栈
    int popElem = 0;
    Pop(linkSt,&popElem);//出栈，结果输出给popElem
    cout<<popElem<<endl;//输出 出栈的元素
    Pop(linkSt,&popElem);//出栈，结果输出给popElem
    cout<<popElem<<endl;//输出 出栈的元素
    Pop(linkSt,&popElem);//出栈，没有元素了.栈空
    return 0 ;
}