面试官问我什么是「栈」，我随手画了10张图来解释(8)

其编译结果如下：

栈链表
#include<stdio.h>#include<stdlib.h>//栈的结点设计//单个结点设计，数据和下一个指针typedefstructnode{int data; structnode *next;} Node;//利用上面的结点创建栈，分为指向头结点的top指针和计数用的counttypedefstructstack{Node *top;int count;} Link_Stack;//创建栈Link_Stack *Creat_stack(){ Link_Stack *p;//p = new Link_Stack; p=(Link_Stack*)malloc(sizeof(Link_Stack));if(p==NULL){printf("创建失败，即将退出程序");exit(0); }else {printf("创建成功 "); } p->count = 0; p->top = NULL;return p;}//入栈 pushLink_Stack *Push_stack(Link_Stack *p, int elem){if (p == NULL)returnNULL; Node *temp; temp=(Node*)malloc(sizeof(Node));//temp = new Node; temp->data = elem; temp->next = p->top; p->top = temp; p->count ;return p;}//出栈 popLink_Stack *Pop_stack(Link_Stack *p){ Node *temp; temp = p->top;if (p->top == NULL) {printf("错误：