Improvement of my solution to second question : Instead of forming a linked list ,take a heap of the pointer of all elements in the stack. Apply min heapify to the heap using value to which the pointer points as the key. Clearly getMinElement() -------- O(1) push()------------------------------------O(log n) pop()-------------------------------------O(log n)
-- 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.
