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:

    “Mortality, behold, and fear,
    What a change of flesh is here!
    Think how many royal bones
    Sleep within this heap of stones,
    Hence removed from beds of ease,
    Dainty fare, and what might please,”
    —Francis Beaumont (1584-1616)