Lecture
-
Foundations:
- How do we make all the static structures dynamic?
- 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?
- 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?