NAMES:
LOGINS:
PRECEPTS:
COS 226 Exercises on Red-Black Trees
References: Section 3.3 in Algorithms, 4th edition
1.
Draw the sequence of 2-3 trees that result when you insert the following keys
in that order into an initially empty tree, as in the figure on p. 262.
(Draw all of the null links.)
P R I N C E T O G S
2.
Draw sequence of left-leaning red-black trees that result when you insert
the following keys in that order into an initially empty tree, as in
the figure on p. 272. (Draw all of the null links.)
P R I N C E T O G S