北理工數(shù)據(jù)結(jié)構(gòu)作業(yè)2

本文格式為Word版，下載可任意編輯——北理工數(shù)據(jù)結(jié)構(gòu)作業(yè)2第三章作業(yè)

1、寫出以下程序段的輸出結(jié)果。viodmain(){StackS;

charx,y;InitStack(S);x=’c’;y=’k’;

Push(S,x);Push(S,’a’);Push(S,y);Pop(S,x);Push(S,’t’);Push(S,x);Pop(S,x);Push(S,’s’);while(!StackEmpty(S)){Pop(S,y);printf(y);}printf(x);

}答：stack

2、簡述以下算法的功能（棧的元素類型SElemType為int）。（1）Ststusalgo1(StackS){intI,n,A[255];n=0;

while(!StackEmpty(S)){n++;Pop(S,A[n]);}

for(i=1;i#include#include#defineOK1#defineERROR0#defineOVERFLOW-2

#defineSTACK_INIT_SIZE100//存儲空間初始分派量#defineSTACKINCREMENT10//存儲空間分派增量

typedefstruct{//定義運(yùn)算符棧數(shù)據(jù)類型char*base;

輸出：14輸出：-48

輸入：(4+2)*(2-10)=

char*top;intstacksize;}SqStack1;

typedefstruct{//定義操作數(shù)棧數(shù)據(jù)類型int*base;int*top;intstacksize;}SqStack2;

intInitStack1(SqStack1if(!S.base)exit(OVERFLOW);S.top=S.base;

S.stacksize=STACK_INIT_SIZE;returnOK;}//InitStack1

intInitStack2(SqStack2if(!S.base)exit(OVERFLOW);S.top=S.base;

S.stacksize=STACK_INIT_SIZE;returnOK;}//InitStack2

charGetTop1(SqStack1S){//若棧不空，則用char型元素e返回S的棧頂元素，并返回OK；否則返回ERRORchare;

if(S.top==S.base)returnERROR;e=*(S.top-1);returne;}//GetTop1

intGetTop2(SqStack2S){//若棧不空，則用int型元素e返回S的棧頂元素，并返回OK；否則返回ERRORinte;

if(S.top==S.base)returnERROR;e=*(S.top-1);returne;}//GetTop2

intPush1(SqStack1if(!S.base)exit(OVERFLOW);S.top=S.base+S.stacksize;

S.stacksize+=STACKINCREMENT;}

*S.top++=e;returnOK;}//Push1

intPush2(SqStack2if(!S.base)exit(OVERFLOW);S.top=S.base+S.stacksize;

S.stacksize+=STACKINCREMENT;}

*S.top++=e;returnOK;}//Push2

intPop1(SqStack1e=*-