堆栈的顺序存储实现

#include<iostream>
#include<cstdlib>
#include<cstdio>
#define Max 50
#define OK 1
using namespace std;
typedef int ElemType;
typedef struct Stack //顺序栈的定义
{
    ElemType *elem;
    int top;
    int capactiy;
}TStack,TNode;

int StackInit(TStack &s)//顺序栈的初始化
{
    s.elem =(ElemType*)malloc(sizeof(ElemType) * Max);
    if (!s.elem)
        exit(-1);
    s.top = 0;
    s.capactiy = Max;
    return 0;
}

void StackDestory(TStack& s)//销毁栈
{
    if (!s.elem)
        return;
    free(s.elem);
    s.elem = nullptr;
    s.capactiy = 0;
    s.top = 0;
}

void StackClear(TStack& s)//清空栈
{
    s.top = 0;
}

bool StackEmpty(TStack* s)//顺序栈是否为空
{
    return s->top == 0;
}


bool StackPush(TStack* s, ElemType e)//顺序栈入栈
{ 
    s->elem[s->top++] = e;
    return true;
}

bool StackPop(TStack* s)///顺序栈出栈
{
    if (StackEmpty(s)||s->top == 0)
    {
        return false;
    }
    else
    {
        --s->top;
        return true;
    }
}

ElemType StackTop(TStack s)//顺序栈栈顶元素查询
{
    return s.elem[--s.top];
}

void StackShow(TStack s)//顺序栈的遍历
{
    for (int i = 0; i < s.top; ++i)
    {
        cout << s.elem[i] << " ";
    }
}

int main() {
    TStack s ;
    StackInit(s);
    StackPush(&s, 2);
    StackPush(&s, 3);
    StackPush(&s, 4);
    StackPush(&s, 5);
    StackShow(s);
    cout << endl;
    cout << StackTop(s) << endl;
    StackPop(&s);
    StackShow(s);
    cout << endl;
    cout << StackEmpty(&s) << endl;
    StackClear(s);
    cout << StackEmpty(&s) << endl;
    StackDestory(s);
    return 0;

}