Insertion in Binomial Queues

If there’s no rank 0 tree, just put

the new node in as a rank 0 tree.

5

9

3

7

13

15

rank 1

rank 2

insert(10)

10

5

9

3

7

13

15

rank 1

rank 2

10

rank 0

Previous slide

Next slide

Back to first slide

View graphic version