Binomial Heap has quite special design. Personally I don't think this design is intuitive.
Although posts such as What is the difference between binary heaps and binomial heaps? talks about diff and its speciality, I am still wondering when I should use it.
In http://en.wikipedia.org/wiki/Binomial_heap, it says
Because of its unique structure, a binomial tree of order k can be constructed from two trees of order k−1 trivially by attaching one of them as the leftmost child of root of the other one. This feature is central to the merge operation of a binomial heap, which is its major advantage over other conventional heaps.
I presumes that an advantage of Binomial Heap is its merge. However, Leftist heap also has O(logN) merge and much simpler, why we still use Binomial Heap? When should I use Binomial Heap?
Read full article from algorithm - When to use Binomial Heap? - Stack Overflow
No comments:
Post a Comment