Red-Black Trees

A Self-Balancing Binary Search Tree

Properties of Red Black Trees

1. Each node is either red or black.
2. Red nodes cannot have red children.
3. The root is always black.
4. Newly inserted nodes are red.

Learn more about Red-Black Trees here.