Red-Black Tree


In computer science, a Red-Black Tree is a type of binary search tree in which every node is colored with either red or black.

Key Features

Red-Black Tree Properties

  1. Root property: Every node is either red or black, with the root always black.
  2. Depth property: All the leaves have the same black depth.
  3. External property: Every leaf node (null child of a node) is black.
  4. Internal property: Children of a red node are black.

Red-Black Tree Example

Red-Black Tree Example

Learn More

For more information about Red-Black Trees, visit GeeksForGeeks.