Work Note 6, DM819, fall 2009
Discussion Section October 6
-
Exercises 5.1, 5.3, 5.5 (ab), 5.8, 5.10, 5.13.
-
Devise a method for building a red-black tree in linear time
from a sorted sequence of n different keys. The tree
should be external (also called leaf-oriented), i.e., all
keys should be placed in the leaves and internal nodes hold
copies of the keys directing searches to the correct locations.
One potential difficulty in this problem is that not all trees
have a form such that a red-black tree can be created by coloring
nodes red or black.
Discussion Section October 7
-
Exercises 6.2, 6.5, 6.7, 6.8, 6.16.
Last modified: Wed Sep 30 12:30:06 CEST 2009
Kim Skak Larsen
(kslarsen@imada.sdu.dk)