Q33
How would you implement a stack that supports minimum element retrieval in constant time?
A.
Use an additional stack to keep track of minimums
AnswerB.
Use a doubly linked list
C.
Use a hash table to store minimums
D.
Use a binary search tree
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board