This module implements binomial heaps as described in Chris Okasaki's
"Purely Functional Data Structures". A binomial heap is a forest of
binomial trees where each tree satisfies the heap property and trees are
kept in order of increasing rank. Note that these trees are not binary
trees, they can have any number of children.
This module implements binomial heaps as described in Chris Okasaki's "Purely Functional Data Structures". A binomial heap is a forest of binomial trees where each tree satisfies the heap property and trees are kept in order of increasing rank. Note that these trees are not binary trees, they can have any number of children.