Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Binomial heap
open-in-new
<p>In <a href="/facts/Computer_science/lN3pEyPz">computer science</a>, a binomial heap is a <a href="/facts/Data_structure/yNsNvL1I">data structure</a> that acts as a <a href="/facts/Priority_queue/1uXVo4Uf">priority queue</a>. It is an example of a <a href="/facts/Mergeable_heap/GQsK1Gp3">mergeable heap</a> (also called meldable heap), as it supports merging two heaps in logarithmic time. It is implemented as a <a href="/facts/Heap_(data_structure)/A67B0K7L">heap</a> similar to a <a href="/facts/Binary_heap/YPJAEN94">binary heap</a> but using a special tree structure that is different from the <a href="/facts/Complete_binary_tree/TDV7GMpu">complete binary trees</a> used by binary heaps. Binomial heaps were invented in 1978 by <a href="/facts/Jean_Vuillemin/jUWCvsEA">Jean Vuillemin</a>. </p>