Red-Black Tree

Valid Red-Black Trees are binary search trees with following properties:

• Each node is either red or black.
• The root node is black.
• No red nodes have red children.
• Every path from root to a null child has the same number of black nodes.
• Null children are black.

Additional Information