栈ADT，C语言实现（代码）

#include<stdio.h>
#include"stack.h"

void print(SElemType e) {
	printf("%d ", e);
}

int main() {
	SqStack stack;
	int i,j,k;
	printf("初始化\n");
	InitStack(&stack);
	printf("入栈:1,2,3\n");
	Push(&stack, 1);
	Push(&stack, 2);
	Push(&stack, 3);
	printf("遍历：\n");
	StackTraverse(stack, print);
	printf("\n栈顶元素：");
	GetTop(&stack, &i);
	printf("%d\n", i);
	printf("栈长：");
	printf("%d\n", StackLen(&stack));	
	printf("出栈：\n");
	Pop(&stack, &j);
	printf("%d ", j);
	Pop(&stack, &j);
	printf("%d ", j);
	Pop(&stack, &j);
	printf("%d\n", j);
}

//stack.h
#include <stdlib.h>
#define TRUE  1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE  -1
#define OVERFLOW  -2
#define STACK_INIT_SIZE 100
#define STACKINCREMENT 10
typedef int SElemType;
typedef int Status;
typedef struct{
	SElemType *base;
	SElemType *top;
	int stacksize;
}SqStack;

Status InitStack(SqStack *s);                          //初始化
Status DestroyStack(SqStack* s);					   //销毁栈
Status ClearStack(SqStack* s);						   //判空
Status StackEmpty(SqStack* s);						   //置空
Status StackLen(SqStack* s);						   //返回栈长度
Status GetTop(SqStack* s,SElemType *e);				   //返回栈顶元素
Status Push(SqStack *s,SElemType e);				   //入栈
Status Pop(SqStack *s,SElemType *e);				   //出栈
void StackTraverse(SqStack s, void(Visit)(SElemType)); //遍历

Status InitStack(SqStack *s){
	s->base = (SElemType *)malloc(STACK_INIT_SIZE * sizeof(SElemType));
	if (!s->base) exit(OVERFLOW);
	s->top = s->base;
	s->stacksize = STACK_INIT_SIZE;
	return OK;
}

Status DestroyStack(SqStack* s){
	if (s->base != NULL) {
		free(s->base);
		s->base = NULL;
		s->top = NULL;
		return OK;
	}
	else return ERROR;
}

Status ClearStack(SqStack* s){
	(*s).top = (*s).base;
	return OK;
}

Status StackEmpty(SqStack* s){
	if (s->base == s->top) return TRUE;
	else return FALSE;
}

Status StackLen(SqStack* s){
	return s->top - s->base;
 }

Status GetTop(SqStack *s, SElemType *e){
	if (StackEmpty(s)) return(ERROR);
	*e = *--s->top;
	s->top++;
	return OK;
}

Status Push(SqStack *s, SElemType e){
	if (s->base == NULL) exit(OVERFLOW);
	if (StackLen(s) >= s->stacksize) { 
		s->base = (SElemType*)realloc(s->base,(s->stacksize +STACKINCREMENT) * sizeof(SElemType));
		if (!s->base) exit(OVERFLOW);
		s->top = s->base + s->stacksize;
		s->stacksize += STACKINCREMENT;
	}
	*s->top = e;
	s->top++;
	return OK;
}

Status Pop(SqStack *s,SElemType* e) {
	if (StackEmpty(s)) return ERROR;
	*e=*--s->top;
	return OK;
}

void StackTraverse(SqStack s, void(Visit)(SElemType)) {
	SElemType* p;
	p = s.base;
	while (p != s.top) {
		Visit(*p);
		p++;
	}
}