Work Note 14, DM803, fall 2014

Lecture December 9

• Treaps.
• Multi-dimensional priority Queues.
• What did we not cover?
• About the exam: form and questions.

Exercises December 10

1. We finish the treatment of red-black trees with relaxed balance.
2. Together we will develop known relaxed search trees from basic design ideas. For the AVL-trees that we developed in the last exercise session, how could one relax the constraints in such a way that there is still hope that one could fix problems and get back to an actual AVL-tree in reasonable time? Try to make some rebalancing operations based on your idea. Think about (a,b)-trees along the same lines.