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 enqueue? 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 enqueue? Select one: a. O(n) b. O(n log n) O c. O(1) d. O(log n) e. O(n)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
