Note 12, DM819, fall 2018

Exercises December 3

• Exercises 15.1, 15.3, 15.5, 15.6.
• About the exam.

Lecture December 4

• Foundations:
  • Why do we like red-black trees as our base data structure for many problems?
  • Despite of this, should we sometimes consider other data structures?
  • Is Ω(n log n) a reasonable lower bound for our geometric problems, considering the modeling issues?
  • What's the difference between sorting once and repeatedly finding the median?
  • Is linear time heap building significantly better than just inserting all keys into a search tree?