Question: Stack S1 Stack S2 Enqueue(x) S1.push(x) Dequeue(x) if (S1 is empty) while(S1 is not empty) S2.push(S1.pop()) S2.pop() What is the amortized cost of dequeue? Select

Stack S1 Stack S2 Enqueue(x) S1.push(x) Dequeue(x) if (S1 is empty) while(S1 is not empty) S2.push(S1.pop()) S2.pop() What is the amortized cost of dequeue? Select one: a. On?) ob. O(n log n) c. O(log n) o d. O(n) e. O(1)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
