Red-Black Trees

Red-Black Tree is a self balancing binary search tree data structure noted for fast storage and retrieval of ordered information

Properties:

1. Color Property - every node is either Red or Black
2. Black Height Property - the number of black nodes is the same along every path from a fixed node to every descendent null reference
3. Red Child Property - red nodes cannot have a red node as a child
4. Root Property - the root node will be always set to black

Read more about Red-Black trees: Click here