We can find minimum element in O(n) time. Just compare leaf nodes in max heap tree.
Cheers Janardhan Reddy Cheruvu +91-9642421117 On Tue, Sep 20, 2011 at 6:39 PM, saurabh agrawal <saurabh...@gmail.com>wrote: > I think, we have to delete all the elements from the heap which takes > o(n*logn). Please share if you have any better solutions. > > On Tue, Sep 20, 2011 at 6:38 PM, saurabh agrawal <saurabh...@gmail.com>wrote: > >> What is the time to get min element from the binary max heap !! >> You might be given the heap as API. I mean, you dont have implementation >> of the heap. >> > > -- > 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. > -- 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.
