數據結構實驗報告10計算機科學與技術一班王宏旭實驗二棧實驗名稱：棧的順序存儲結構的插入和刪除實驗內容：本程序利用棧的順序存儲結構構造了棧，并實現了棧的插入和刪除功能。程序流程圖：輸入數據輸入數據=999？輸出棧選擇功能=1？=2？=3？輸入插入的數據刪除棧頂元素結束開始否否否是是是否源代碼：#include<stdio.h>#include<stdlib.h>#defineTRUE1#defineFALSE0#defineOK1#defineERROR0#defineINFEASIBLE-1#defineOVERFLOW-2#defineSTACK_INIT_SIZE100#defineSTACKINCREMENT10typedefintSElemType;typedefintStatus;typedefstruct{SElemType*base;SElemType*top;intstacksize;}SqStack;StatusInitStack(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;returnOK;}StatusPush(SqStackS,SElemTypee){if(S.top-S.base>=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+1)=e;returnOK;}StatusPop(SqStackS,SElemType*e){if(S.top==S.base)returnERROR;e=*--S.top;returnOK;}voidmain(){SqStackS;intj;intn,i,count=0;SElemTypee;clrscr();InitStack(&S);for(i=0;;i++){scanf("%d",&S.base[i]);if(S.base[i]==999)break;S.top=&S.base[i];count++;}for(i=0;i<count;i++)printf("%d\t",S.base[i]);while(1){printf("\n1.push2.pop3.exit");scanf("%d",&j);if(j==1){printf("what'sthenumberyouwanttopush:");scanf("%d",&e);Push(S,e);count++;S.top++;S.base[count]=S.top;for(i=0;i<count;i++)printf("%d\t",S.base[i]);}if(j==2){Pop(S,e);count--;S.top--;S.base[count]=S.top;