Question

You implemented a stack as a singly linked list (you add at the head and remove from the head). Perform the following operations on

the stack: push(50), push(90), push(30), push(53), push(52), pop(), push(51), pop(), pop(), push(100), and push(15).

After all the operations are performed, draw the resulting linked list. Indicate which node is the top of the stack in the resulting linked

list.

Answer 1

push(50)    top -> [50]
push(90)    top -> [90] -> [50]
push(30)    top -> [30] -> [90] -> [50]
push(53)    top -> [53] -> [30] -> [90] -> [50]
push(52)    top -> [52] -> [53] -> [30] -> [90] -> [50]
pop()       top -> [53] -> [30] -> [90] -> [50]
push(51)    top -> [51] -> [53] -> [30] -> [90] -> [50]
pop()       top -> [53] -> [30] -> [90] -> [50]
pop()       top -> [30] -> [90] -> [50]
push(100)   top -> [100] -> [30] -> [90] -> [50]
push(15)    top -> [15] -> [100] -> [30] -> [90] -> [50]

Answer:
---------
value of the stack is top -> [15] -> [100] -> [30] -> [90] -> [50]
with 15 at the top of the stack.