Repeat the previous problem for red-black trees T and U. Justify Proposition 11.7. The Boolean indicator used to mark nodes in a red-black tree as being “red” or “black” is not strictly needed...

Repeat the previous problem for red-black trees
T
and
U.

Justify Proposition 11.7.

The Boolean indicator used to mark nodes in a red-black tree as being

“red” or “black” is not strictly needed when we have distinct keys. Describe

a scheme for implementing a red-black tree without adding any

extra space to standard binary search tree nodes.