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:

    “Squalor spreads its hideous length
    through the carts and the asses’ feet,
    squalor coils and reopens
    and creeps under barrow
    and heap of refuse....”
    —Hilda Doolittle (1886–1961)