Weekly Note 11, DM45, spring 2007

Lecture April 25

• Binary Space Partitions (section 12.0 - 12.3).

Discussion Section April 23

• Exercises 10.2, 10.5, 10.6(a), 10.9, 10.10.

  Exercises 10.2 and 10.5 are the hardest. So, also consider the other problems even if these cause you some difficulties. In 10.2, you do not need to build a priority search tree which looks exactly like the structure build using the normal construction method. You should just build something with the same asymptotic properties.