Red Black Tree

What is it?

A Red Black Tree is a self-balancing binary search tree.

Properties

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

Example

Learn more about Red Black Trees