Red Black Trees Definition

A Red Black Tree is a self-balancing binary search tree

Red Black Tree Rules

• Root must be black
• All paths from root to null must have same number of black nodes
• Red node cannot have red children
• For More Information