Binomial Queue Heap Data Structure

• Composed of a forest of binomial trees, no two of the same rank

• Heap-order enforced within each tree

• Ranks present can be computed using the binary representation of the tree’s size

5

9

3

7

13

15

4

6

10

21

size = 10 = 10102

rank 1

rank 3

rank 0

rank 1

rank 2

rank 3

Previous slide

Next slide

Back to first slide

View graphic version