Red-Black Trees Definition

Definition: A Binary Tree, Satisfying:

1. Every node is actually red or black
2. The root is black
3. Every leaf is NIL and is black
4. If a node is red, then both its children are black
5. For each node, all paths from the node to descendant leaves contain the same number of black nodes.
   
   

A Red-Black Tree can also be defined as a binary search tree that satisfies the following properties:

• Root Property:The root is black
• External Property:Every leaf is black
• Internal Property:The children of a red node are black
• Depth Property:All the leaves have the same black depth

Following are some of the areas in Red-Black Trees in which we provide help:

Definition: a binary tree, satisfying

Red-Black Tree Reorganization

Red-Black Tree Insert