Chapter 17.5, Problem 29SC

Explanation of Solution

Red-black Tree:

• A special kind of binary search tree that gets rebalances by itself after every insertion or removal.
• Every node is colored red or black.
• The root node is black
• A red node cannot have a red child.
• All the path from the root to a null have the same number of black nodes.

Possibility:

Consider the below scenario of removing the “X” black leaf.