CSE 250: Data Structures
Week 11
March 24 - 28, 2008
Announcements
Extra Credit for Midterm in class activity on
March 24th
Resign Deadline: March 28th
Project 3 due April 4th
Homework 4 due April 11th
Homework 5 due April 18th
Week’s Notes
Extra Credit Activity Monday (and some of
Wednesday)
Leftist Heaps
Optimized for merging heaps together
Skew Heaps
Similar to leftist heaps, but always swap
children during merge
Binomial Queues
Week’s Notes
Binomial Queues
Collection of binomial trees (heap-ordered
trees) where there for a binomial tree Bk,
there are exactly 2k nodes in the tree
Construction of binomial queue
corresponds nicely to binary numbers and
insertion and deletion of one node mimics
bit patterns of binary arithmetic