binomial heap
A binomial heap is a type of priority queue that is represented as a collection of binomial trees. Each binomial tree follows the binomial heap property, which states that the key of a node is always greater than or equal to the keys of its children. Binomial heaps are particularly efficient for mergeable heaps and can perform heap operations efficiently, such as insertion, deletion, and merging, in logarithmic time complexity.
Requires login.