Binomial Queues A binomial queue is a forest of binomial trees Each in heap order  Each of a different height  A binomial tree Bk of height k consists of two Bk-1 binomial trees The root of one Bk-1 tree is the child of the root of the other Bk-1 tree Bk-1 Bk = Bk-1 41
Binomial Queues A binomial queue is a forest of binomial trees   Each in heap order Each of a different height A binomial tree Bk of height k consists of two Bk-1 binomial trees The root of one Bk-1 tree is the child of the root of the other Bk-1 tree Bk = Bk-1 Bk-1 41
ADS-AUK-UNIT-3.docx