栈是限制插入和删除只能在一个位置上进行的表，该位置是表的末端，叫做栈顶（top）。push进栈相当于插入，pop相当于删除最后插入的元素，一般不对空栈进行pop和top操作,还有一个，push的时候空间用尽是一个实现错误.
/*栈的实现，包括对栈实现初始化，插入栈顶元素，删除栈顶元素，遍历栈，清空栈等基本操作*/#include#include #include #include #include #define STACK_SIZE 6void Empty(struct Stack *temp);/*创建一个空栈的辅助函数*/struct Stack *CreateStack(void);/*创建一个空栈*/int IsEmpty(struct Stack *S);/*测试栈是否为空*/void Push( struct Stack*sp); /*进栈例程*/int Top(struct Stack*temp); /*返回栈顶元素*/void Pop(struct Stack*temp); /*从栈弹出元素*/void Rebuild(struct Stack *p); /*释放栈空间*/void Print(); /*菜单打印*/void Exit(); /*退出*/struct Stack { /*栈的声明*/ int Element; struct Stack *next;};struct Stack *stack = NULL;int main(void) { char ch = '\0'; while (1) { system("cls"); fflush(stdin); Print(); scanf(" %c",&ch); switch (ch) { case'a': stack=CreateStack(); break; case'b': Push(stack); break; case'c': Top(stack); break; case'd': Pop(stack); break; case'e': Rebuild(stack); break; case'f': Exit(); break; default: printf("无此选择项!\n"); system("pause"); break; } } return 0;}void Rebuild(struct Stack *p) { if (p==NULL) { printf("Must use CreateStack first!"); return; } struct Stack *temp = NULL; struct Stack *tt = NULL; temp = p; p->next = NULL; while (temp != NULL) { tt = temp->next; free(temp); temp = tt; } puts("Rebuild!\n"); system("pause");}void Exit() { /*这个是用来退出*/ int i = 0; printf("退出中"); for (i = 4; i > 0; --i) { Sleep(200); printf("."); } exit(0);}void Print(){ printf("-----主菜单功能如下:\n"); printf("-----a.创建一个栈\n"); printf("-----b.Push进栈\n"); printf("-----c.Top返回栈顶元素\n"); printf("-----d.Pop出栈\n"); printf("-----e.释放栈空间\n"); printf("-----f.退出\n");}int IsEmpty(struct Stack *S) { return S->next == NULL?1:0;}struct Stack *CreateStack(void){ struct Stack *temp=NULL; struct Stack *current = NULL; struct Stack *last = NULL; int size = STACK_SIZE; int a = 0; temp = (struct Stack*)malloc(sizeof(struct Stack)); while (size-- > 0) { current = (struct Stack*)malloc(sizeof(struct Stack)); if (temp == NULL) temp = current; if (last != NULL) last->next = current; current->next = NULL; last = current; } puts("Created!"); return (temp);}void Empty(struct Stack *temp) { if (temp == NULL) { printf("Must use CreateStack first!"); return; } else temp->next = NULL;}void Push( struct Stack*sp){ int x=0; struct Stack *temp = NULL; temp = (struct Stack*)malloc(sizeof(struct Stack)); if (temp == NULL) { printf( "out of space!"); } else { printf("Please enter a Element x!\n"); scanf("%d",&x); temp->Element = x; temp->next = sp->next; sp->next = temp; }}int Top(struct Stack*temp) { if (!IsEmpty(temp)) return temp->next->Element; printf( "Empty stack"); return 0; }void Pop(struct Stack*temp) { struct Stack *first = NULL; if(IsEmpty(temp)) printf("Empty stack"); else { first = temp->next; temp->next = temp->next->next; free(first); }}