Binomial heap
Data structure that acts as a priority queue / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Binomial heap?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
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 similar to a binary heap but using a special tree structure that is different from the complete binary trees used by binary heaps.[1] Binomial heaps were invented in 1978 by Jean Vuillemin.[1][2]
"Binomial tree" redirects here. For binomial price trees, see binomial options pricing model.
Quick Facts Type, Invented ...
Binomial heap | |||||||||||||||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Type | heap | ||||||||||||||||||||||||||||||||
Invented | 1978 | ||||||||||||||||||||||||||||||||
Invented by | Jean Vuillemin | ||||||||||||||||||||||||||||||||
Complexities in big O notation | |||||||||||||||||||||||||||||||||
|
Close