Red Black Trees

Red Black Trees Description

In computer science, a red black tree is a specialised binary search tree data structure noted for fast storage and retrieval of ordered information.

Red Black Tree Rules List

  1. Every node is either red or black.
  2. Every leaf (NULL) is black.
  3. If a node is red, then both its children are black.
  4. Every simple path from a node to a descendant leaf contains the same number of black nodes.

More information about Red Black Trees.