first option is correct. Because we are not allowed to use any extra space.
On Aug 21, 6:36 pm, priya ramesh <love.for.programm...@gmail.com> wrote: > A "Most efficient data structure" is designed to optimize the following > operations. Pop, Push, Min. The best possible time-complexities with no > extra space, respectively would be: > > · Pick one of the choices > > O(1), O(1), O(N) > > O(1), O(N), O(1) > > O(N), O(1), O(1) > > O(1), O(1), O(1) -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
