The Rules

• Every node is either red or black

• Every null reference is considered to be a link to a black node

• Red nodes must have ONLY black children

• Every simply path from the root to any leaf contains the same number of black nodes as any other such simple path.