Red-Black Trees

Red-Black Trees are self balancing binary search trees. They are used to quickly find and retrieve data. Here is an example of a Red-Black Tree:

Here are some properties of Red-Black Trees

• Every tree node must be either red or black
• The root node of the tree is always black
• A red node cannot have a red parent
• Black height is the same along every path from a node to any descendant null reference

For more information visit this website