Red-Black Trees

Key Properties

• Every node is either red or black.
• The root node is always black.
• Red nodes cannot have red children.
• Every path from a node to its furthest null nodes must have the same number of black nodes along it (Same black height).

Red-Black Tree Example

Learn More

For more details, visit the Wikipedia page on Red-Black Trees.