Red-Black Trees

What are Red-Black Trees?

A type of balanced binary search tree that uses coloring for nodes.

Properties of a Red-Black Tree

• Every node is either red or black.
• The root is always black.
• No two red nodes are adjacent.

Learn more about Red-Black Trees here.