數(shù)據(jù)結(jié)構(gòu)實驗報告4883

數(shù)據(jù)結(jié)構(gòu)實驗報告數(shù)據(jù)結(jié)構(gòu)實驗報告想必學計算機專業(yè)的同學都知道數(shù)據(jù)結(jié)構(gòu)是?門?較重要的課程，那么，下?是CN?才公???編給?家整理收集的數(shù)據(jù)結(jié)構(gòu)實驗報告，供?家閱讀參考。數(shù)據(jù)結(jié)構(gòu)實驗報告1?、實驗?的及要求1)掌握棧和隊列這兩種特殊的線性表，熟悉它們的特性，在實際問題背景下靈活運?它們。本實驗訓練的要點是“?！焙汀瓣犃小钡挠^點;?、實驗內(nèi)容1)利?棧，實現(xiàn)數(shù)制轉(zhuǎn)換。2)利?棧，實現(xiàn)任?個表達式中的語法檢查(選做)。3)編程實現(xiàn)隊列在兩種存儲結(jié)構(gòu)中的基本操作(隊列的初始化、判隊列空、?隊列、出隊列);三、實驗流程、操作步驟或核?代碼、算法?段順序棧：StatusInitStack(SqStack&S){S.base=(ElemType*)malloc(STACK_INIT_SIZE*sizeof(ElemType));if(!S.base)returnERROR;S.top=S.base;S.stacksize=STACK_INIT_SIZE;returnOK;}StatusDestoryStack(SqStack&S){free(S.base);returnOK;}StatusClearStack(SqStack&S){S.top=S.base;returnOK;}StatusStackEmpty(SqStackS){if(S.base==S.top)returnOK;returnERROR;}intStackLength(SqStackS){returnS.top-S.base;}StatusGetTop(SqStackS,ElemType&e){if(S.top-S.base>=S.stacksize){S.base=(ElemType*)realloc(S.base,(S.stacksize+STACKINCREMENT)*sizeof(ElemType));if(!S.base)returnERROR;S.top=S.base+S.stacksize;S.stacksize+=STACKINCREMENT;}*S.top++=e;returnOK;}StatusPush(SqStack&S,ElemTypee){if(S.top-S.base>=S.stacksize){S.base=(ElemType*)realloc(S.base,(S.stacksize+STACKINCREMENT)*sizeof(ElemType));if(!S.base)returnERROR;S.top=S.base+S.stacksize;S.stacksize+=STACKINCREMENT;}*S.top++=e;returnOK;}StatusPop(SqStack&S,ElemType&e){if(S.top==S.base)returnERROR;e=*--S.top;returnOK;}StatusStackTraverse(SqStackS){ElemType*p;p=(ElemType*)malloc(sizeof(ElemType));if(!p)returnERROR;p=S.top;while(p!=S.base)//S.top上??個...{p--;printf("%d",*p);}returnOK;}StatusCompare(SqStack&S){intflag,TURE=OK,FALSE=ERROR;ElemTypee,x;InitStack(S);flag=OK;printf("請輸?要進?；虺鰲５脑兀?);while((x=getchar())!='#'&&flag){switch(x){case'(':case'[':case'{':if(Push(S,x)==OK)printf("括號匹配成功!\n\n");break;case')':if(Pop(S,e)==ERROR||e!='('){printf("沒有滿?條件\n");flag=FALSE;}break;case']':if(Pop(S,e)==ERROR||e!='[')flag=FALSE;break;case'}':if(Pop(S,e)==ERROR||e!='{')flag=FALSE;break;}}if(flag&&x=='#'&&StackEmpty(S))returnOK;elsereturnERROR;}鏈隊列：StatusInitQueue(LinkQueue&Q){Q.front=Q.rear=(QueuePtr)malloc(sizeof(QNode));if(!Q.front)returnERROR;Q.front->next=NULL;returnOK;}StatusDestoryQueue(LinkQueue&Q){while(Q.front){Q.rear=Q.front->next;free(Q.front);Q.front=Q.rear;}returnOK;}StatusQueueEmpty(LinkQueue&Q){if(Q.front->next==NULL)returnOK;returnERROR;}StatusQueueLength(LinkQueueQ){inti=0;QueuePtrp,q;p=Q.front;while(p->next){i++;p=Q.front;q=p->next;p=q;}returni;}StatusGetHead(LinkQueueQ,ElemType&e){QueuePtrp;p=Q.front->next;if(!p)returnERROR;e=p->data;returne;}StatusClearQueue(LinkQueue&Q){QueuePtrp;while(Q.front->next){p=Q.front->next;free(Q.front);Q.front=p;}Q.front->next=NULL;Q.rear->next=NULL;returnOK;}StatusEnQueue(LinkQueue&Q,ElemTypee){QueuePtrp;p=(QueuePtr)malloc(size