Red-Black Trees

What is a Red-Black Tree?

A Red-Black Tree is a self-balancing binary search tree where each node has a color (red or black).

Properties

• Every node is either red or black
• The root is always black
• Red nodes cannot have red children
• All paths from root to leaves have the same number of black nodes

Diagram

Learn More

For more information, visit: Red-Black Tree Wikipedia