Propose a data structure that supports the stack push and pop operations
and a third operation find_min, which returns the smallest element in
the data structure, all in O(1) worst case time.
Given a stack S, write a C program to sort the stack (in the ascending
order).
We are not allowed to make any assumptions about how the stack is implemented.
The only functions to be used are:
Push
Pop
Top
IsEmpty
IsFull
Explain how to implement two stacks in one array in such a way that neither stack overflows unless the total number of elements in both stacks together in n. The push and pop operations should run in O(1) time.
Starred