This is really a nice, clean answer. Cool!
On Oct 16, 11:00 am, "juver++" <[email protected]> wrote: > Suppose you have a stack data structure which has additional > operation findMin() - returns smallest element on the stack. > This can be easily updated in O(1) while pushing new element onto the > stack. > > It is known that queue DS can be simulated by using two stacks (here > we use stacks which have findMin routine). > From this point we are able to retrieve smallest element from the > queue in O(1). > > On 13 ÏËÔ, 22:22, malli <[email protected]> wrote: > > > > > A queue data structure has functions enqueue(int x) ( inserts element > > in right end), dequeue() ( deletes element from left end) functions. > > These operations take O(1) time. Modify this queue data structure, so > > that šit supports findmin() which returns minimum element of stack in > > O(1) time. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
