Questions Bank | Page 138920

Following is C++ like

pseudo code of a function that takes a

Queue as an argument, and uses a stack

to do processing. What does the below function do in general?

void fun(Queue *Q)

{

Stack

S; // Say it creates an

empty

stack S

// Run while Q is not empty

while (!isEmpty(Q))

{

// deQueue an item from Q and push the dequeued item to S

push(&S, deQueue(Q));

}

// Run while

Stack S is not empty

while (!isEmpty(&S))

{

// Pop an item from S and enqueue the poppped item to Q

enQueue(Q, pop(&S));

}

Makes Q empty

❌

Removes the last from Q

❌

Reverses the Q

✅

Keeps the Q same as it was before the

call

❌

View this question

Crowdly