Editing Binomial heap (section)

{{Short description|Data structure that acts as a priority queue}}
{{Use dmy dates|date=May 2018}}
{{redirect|Binomial tree|binomial price trees|binomial options pricing model}}
{{Infobox data structure-amortized
| name = Binomial heap
| type = [[Heap (data structure)|heap]]
| invented_by = Jean Vuillemin
| invented_year = 1978
| insert_avg = ''Θ''(1)
| insert_worst = O(log ''n'')
| delete_min_avg = ''Θ''(log ''n'')
| delete_min_worst = O(log ''n'')
| find_min_avg = ''Θ''(1)
| find_min_worst = O(1)
| decrease_key_avg = ''Θ''(log ''n'')
| decrease_key_worst = O(log ''n'')
| merge_avg = ''Θ''(log ''n'')
| merge_worst = O(log ''n'')
}}

In [[computer science]], a '''binomial heap''' is a [[data structure]] that acts as a [[priority queue]]. It is an example of a [[mergeable heap]] (also called meldable heap), as it supports merging two heaps in logarithmic time. It is implemented as a [[Heap (data structure)|heap]] similar to a [[binary heap]] but using a special tree structure that is different from the [[complete binary tree]]s used by binary heaps.<ref name=clrs>{{Introduction to Algorithms |edition=2 |chapter=Chapter 19: Binomial Heaps |pages=455–475}}</ref> Binomial heaps were invented in 1978 by [[Jean Vuillemin]].<ref name="clrs" /><ref>{{Cite journal|last=Vuillemin|first=Jean|date=1 April 1978|title=A data structure for manipulating priority queues|journal=Communications of the ACM|volume=21|issue=4|pages=309–315|doi=10.1145/359460.359478|doi-access=free}}</ref>