顺序栈c语言实现

#include <stdio.h>
#include <stdlib.h>
#define STACK_INIT_SIZE 100
#define STACKINCREMENT 10
typedef int Status;
typedef int ElemType;
typedef struct {
	ElemType *base;
	ElemType *top;
	int stacksize;
}SqStack;
//初始化一个顺序栈
Status Init_Stack(SqStack &s) {
	s.base = (ElemType*)malloc(STACK_INIT_SIZE * sizeof(ElemType));
	if(!s.base) return 0;
	s.top = s.base;
	s.stacksize = STACK_INIT_SIZE;
	return 1;
} 
//插入操作
Status Insert_Stack(SqStack &s, ElemType e) {
	if((s.top - s.base) >= s.stacksize)	{
		ElemType *p = (ElemType*)realloc(s.base, (STACK_INIT_SIZE + STACKINCREMENT) * sizeof(ElemType));
		if(!p) return 0;
		s.base = p;
		s.top = s.base + s.stacksize;
		s.stacksize = s.stacksize + STACKINCREMENT;
	}
	*s.top = e;
	s.top++;
	return 1;
} 
//删除操作
Status Delete_Stack(SqStack &s, ElemType &e) {
	if(s.base == s.top) return 0;
	s.top--;
	e = *s.top;
	return 1;
}
//查找第i个栈元素并用e返回 
Status GetElem_Stack(SqStack s, int i, ElemType &e) {
	if(i < 1 || i > (s.top - s.base)) return 0;
	e = s.base[i - 1];
	return 1; 
} 
//遍历栈元素
Status Traverse_Stack(SqStack &s) {
	for(int i = 0; i < (s.top - s.base); i++) {
		printf("%d ", s.base[i]);
	}
	return 1;
} 
int main(void) {
	SqStack s;
	Init_Stack(s);	
	Insert_Stack(s, 1);
	Insert_Stack(s, 2);
	Insert_Stack(s, 3);
	Insert_Stack(s, 4);
	Traverse_Stack(s);
	ElemType e;
	GetElem_Stack(s, 3, e);
	printf("%d\n", e);
	Delete_Stack(s, e); 
	Traverse_Stack(s);
}