Binomial Heap

In computer science, a binomial heap is a heap similar to a binary heap but also supports quick merging of two heaps. This is achieved by using a special tree structure. It is important as an implementation of the mergeable heap abstract data type (also called meldable heap), which is a priority queue supporting merge operation.

Read more about Binomial Heap:  Binomial Tree, Structure of A Binomial Heap, Implementation, Performance, Applications

Famous quotes containing the word heap:

    A heap of epithets is poor praise: the praise lies in the facts, and in the way of telling them.
    —Jean De La Bruyère (1645–1696)