Q25
How do you implement a stack with O(1) time complexity for both push and pop operations?
A.
Using an array with dynamic resizing
B.
Using a linked list
AnswerC.
Using a fixed-size array
D.
Using a doubly linked list
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board