C语言实现 栈 的顺序存储

代码和实现如下：包含了栈的构建、入栈、出栈、栈空判断、栈顶元素获取、栈的大小判断等功能。

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX 100
typedef struct Stack
{
    void *data[MAX]; //不确定数组类型，保留数据地址即可，再用二级指针操作地址
    int size;        //栈的大小
} Stack;
Stack *initStack() //栈的初始化
{
    Stack *stack = (Stack *)malloc(sizeof(Stack));//向堆区申请内存
    if (stack == NULL)
        return NULL;
    memset(stack->data, 0, sizeof(void *) * MAX);//data初始化
    stack->size = 0;//size初始化
    return stack;
}
int push(void *data, Stack *stack) //数据入栈
{
    if (data == NULL || stack == NULL || stack->size == MAX)//NULL判断及栈满判断
        return 0;
    stack->data[stack->size] = data;
    stack->size++;//栈的大小加一
    return 1;
}
int pop(Stack *stack) //数据出栈
{
    if (stack == NULL || stack->size == 0)
        return 0;
    free(stack->data[stack->size - 1]);
    stack->data[stack->size - 1] = NULL;
    stack->size--;//栈的大小减一
    return 1;
}
void *peek(Stack *stack) //返回栈顶元素
{
    if (stack == NULL || stack->size == 0)//NULL判断和栈空判断
        return NULL;
    return stack->data[stack->size - 1];
}
int sizeOfStack(Stack *stack)//返回栈的大小
{
    if (stack == NULL)//空指针判断
        return -1;
    return stack->size;
}
int isEmptyStack(Stack *stack)//判断栈空
{
    if (stack == NULL)
        return -1;
    return stack->size == 0;
}
typedef struct Student//以栈存储Student结构体为例
{
    int id;
    char name[20];
} Student;
int main()
{
    Student stu1 = {1, "jakes"};
    Student stu2 = {3, "jakes3"};
    Student stu3 = {5, "jakes5"};
    Student stu4 = {7, "jakes7"};
    Stack *stack = initStack();
    push(&stu1, stack);
    push(&stu2, stack);
    push(&stu3, stack);
    push(&stu4, stack);
    printf("size:%d\tisEmpty:%d\t\n", sizeOfStack(stack), isEmptyStack(stack));
    while(!isEmptyStack(stack))
    {
        Student *stu = (Student *)peek(stack);
        printf("%d\t%s\t", stu->id, stu->name);
        pop(stack);
        printf("size:%d\tisEmpty:%d\t\n", sizeOfStack(stack), isEmptyStack(stack));
    }
    return 0；
}

运行结果如下