Insertion in Binomial Queues

insert(10)

5

3

7

rank 0

rank 1

10

3

7

5

10

rank 2

3

7

rank 0

rank 1

5

10

It’s like addition of binary numbers!

1+1 = 0 plus a carry tree

1+1+1 = 1 plus a carry tree

runtime:

Previous slide

Next slide

Back to first slide

View graphic version