数据结构课件汇习题课三章参.pdfVIP

P.84E3

(a)

Error_codestack_to_queue(Stacks,Queueq)

/*

Pre:TheStacksandtheQueueqhavethesameentrytype.

Post:Allentriesfromshavebeenmovedtoq.Ifthereisnotenoughroominqto

hold

allentriesinsreturnacodeofoverflow,otherwise

returnsuccess.*/

{

Error_codeoutcome=success;

Entryitem;

while(outcomesuccess!s.empty()){

s.top(item);

outcome=q.append(item);

if(outcomesuccess)s.pop();

}

return(outcome);

}

（b）

Error_codequeue_to_stack(Stacks,Queueq)

/*Pre:TheStacksandtheQueueqhavethesameentrytype.

Post:Allentriesfromqhavebeenmovedtos.Ifthereisnotenoughroominstohold

all

entriesinqreturnacodeofoverflow,otherwisereturnsuccess.*/

{

Error_codeoutcome=success;

Entryitem;

while(outcomesuccess!q.empty()){

q.retrieve(item);

outcome=s.push(item);

if(outcomesuccess)q.serve();

}

return(outcome);

}

(c)

Error_codemove_stack(Stacks,Stackt)

/*

Pre:None.

Post:Allentriesfromshavebeenmovedinorder

ontothetopoft.Ifthereisnotenoughroominttohold

theseentriesreturnacodeofoverflow,otherwisereturnsuccess.*/

{

Error_codeoutcome=success;

Entryitem;

Stacktemp;

while(outcomesuccess!s.empty()){

s.top(item);

outcome=temp.push(item);

if(outcomesuccess)s.pop();

}

while(outcomesuccess!temp.empty()){

temp.top(item);

outcome=t.push(item);

if(outcomesuccess)temp.pop();

}

while(!temp.empty()){//replaceanyentriestosthatcannotfitont

temp.top(item);

s.push(item);

}

return(outcome);

}