a) Consider a modified red-black tree which satisfies all the usual conditions for a red-black tree exceptthat the root may be either black or red. Suppose a modified red-black tree T has a red root node. If we recolor the root node black, is the resulting tree a “normal” red-black tree?
b)  What is the largest and smallest number of nodes in a red-black tree with black-height k?

“Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!”


"Are you looking for this answer? We can Help click Order Now"