its O(nlogn) only... n v cant directly access d leaf element... since d leaf elements are n(n-1)/2....so last dese many elemnts will found n compared...
Regards, PAYAL GUPTA, CSE-3rd yr NIT_B On Tue, Sep 20, 2011 at 10:54 PM, saurabh agrawal <[email protected]>wrote: > How will you directly access the leaf nodes, you dont have the heap > implementation, you are just provided with the API. :) > > > > On Tue, Sep 20, 2011 at 9:55 PM, sukran dhawan <[email protected]>wrote: > >> o(n) >> >> >> On Tue, Sep 20, 2011 at 6:42 PM, CHERUVU JAANU REDDY < >> [email protected]> wrote: >> >>> >>> 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 >>> <[email protected]>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 >>>> <[email protected]>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 [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. >>>> >>> >>> -- >>> 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. >>> >> >> -- >> 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. >> > > -- > 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. > -- 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.
