In
computer science, a
Binomial Heap is a
set of
binomial trees[?] that satisfy
binomial heap properties:
- Each binomial tree in the heap obeys the min-heap property: the key of a node is greater than or equal to the key of its parent.
- For any non-negative integer j, there is at most one binomial tree in the heap whose root has degree j.
The properties tell us that the root of a binomial tree contains the smallest key in the tree and that an n-node binomial heap consists of at most lg n + 1 binomial trees.
- TODO: Draw a graphic rep of a b. heap