In above post O(1) refers to complexity of merge of two binomial trees of order "k-1" forming a binomial heap of order k....
On Fri, Mar 4, 2011 at 6:10 PM, Kunal Patil <[email protected]> wrote: > Can someone tell me where Binomial heaps are used ??? > I know they support heap_merge operation in O(1)... > but where actually these quickly mergeable heaps are required ??? > > -- > 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.
