Overview

This page describes key properties of red black trees

Key Properties of Red Black Trees

• All nodes are either red or black and the root is always black
• Red nodes cannot have red children
• Every path from a node to its descendent null nodes must have the same number of black nodes
• Null nodes are considered black

Link to more info