数据结构3.0顺序栈的push，pop

#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>

typedef struct SNODE
{
int *data;
int top;
int MAXSIZE;
}*stack, node;

stack initi_stack(int n);
bool is_full(stack plist);
bool push(stack plist, int val);
bool pop(stack plist, int *val);
bool is_empty(stack plist);

int main(void)
{
int lens;
int val;
int i;
printf(“请输入您要生成的栈的大小：\n”);
scanf("%d", &lens);
stack S = initi_stack(lens);
push(S, -1314);
push(S, -25);
push(S, 52);
push(S, 727);
for ( i = 0; i <= S->top; i++)
{
printf("%d “, S->data[i]);
}
printf(”\n");
pop(S, &val);
for ( i = 0; i <= S->top; i++)
{
printf("%d “, S->data[i]);
}
printf(”\n");
free(S