Keywords

#binomial_heap

Binomial heap

Data structure that acts as a priority queue

In computer science, a binomial heap is a data structure that acts as a priority queue. It is an example of a mergeable 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. Binomial heaps were invented in 1978 by Jean Vuillemin.

Sat 27th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Binomial heap Skew binomial heap Heap (data structure) Fibonacci heap Binomial Binary heap Weak heap Comparison of data structures Pairing heap Priority queue
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.