7. [Group Problem] Group 1 grades this problem (submit 4 copies)
Problem 13-1 from CLR.
8. [Group Problem] Saunders grades this problem (submit 1 copy)
Problem 14-2 from CLR and this additional part:
f. Describe how to also implement RB-Joy(T1, T2)
which is like RB-Join(T1, x, T2) except that no intermediate
node x is given. For RB-Joy, you assume
the keys in red black treeT1
are all less than the keys in red black treeT2.
[Question to think about (this is not part of the homework problem).
How fast could you do the join operation on two red black trees without
the assumption that the keys in one are less than the keys in the other?
]
9. [Individual Problem] Group 7 grades this problem (submit 4 copies)