@AlgoSau Sau * * Stack and Qeueue are different. In case of stack insertions and deletions happen at only one end. That has favoured in devising a DS which returns min value in O(1) complexity. In Queue we insert at one end and delete at other end. The technique applied to stack can not be applied to queue.
On Thu, Oct 14, 2010 at 12:17 AM, AlgoSau Sau <algos...@gmail.com> wrote: > Similar question was posted sometime back but the DS in question was stack. > please look in to the existing topics to look for the solution to your > problem. > > > On Thu, Oct 14, 2010 at 12:13 AM, rahul <rahulr...@gmail.com> wrote: > >> it look like a priority queue type of DS to me >> well min-heap is another solution,which do the heap process at each >> insertion and deletion,so that min element stay the root position. >> >> comments invited. >> >> regards. >> >> >> On Wed, Oct 13, 2010 at 11:52 PM, malli <mallesh...@gmail.com> 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 algoge...@googlegroups.com. >>> To unsubscribe from this group, send email to >>> algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> >>> . >>> For more options, visit this group at >>> http://groups.google.com/group/algogeeks?hl=en. >>> >>> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to algoge...@googlegroups.com. >> To unsubscribe from this group, send email to >> algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> >> . >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@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.
