Binomial Heap Properties
Each binomial tree is heap-ordered (key(x)
This is the opposite of previous heap properties.
There never exist two or more trees with the same degree in the heap.
A binomial heap with n nodes has at most
n in binary = <
, n =
There is a one-to-one mapping between the binary representation and binomial trees in a binomial heap.
= 1, then
is in the heap
Recall that there are 2
+ 1 bits are needed to express n base 2