COS 554 SPRING 2009 HW #9  DUE TUESDAY 4/28/09
p. 425: 17.4-3, 20 points
p. 440: 18.1-3, 10 points
p. 441: 18.1-4, 10 points
p. 447: 18.2-1, 10 points
p. 447: 18.2-3, 10 points
p. 452: 18.3-1, 15 points
p. 472: 19.2-2, 10 points
p. 472: 19.2-3, 15 points
********** Problem Notes *********,

Write a simple B-tree package that can insert and delete nodes. Use this 
package to do exercises 18.2-1 and 18.3-1.

Write a simple Binomial Heap package that can insert and delete nodes. Use 
this package to do exercises 19.2-2 and 19.2-3.

It is easiest to write the above packages in a language that has dynamic 
memory allocation and the list type. If you can't quite finish the 
programs, do as much as you can. At a minimum, do the problems by hand.