Red-Black Tree

What is a Red-Black Tree?

Red-Black trees are Binary Search Trees that stay balanced(self-balancing).

Properties of Red-Black Tree

• Each node is either red or black
• The root node is black
• No red nodes have red children
• All paths from the root to a null child have the same number of black nodes

An Example Diagram

More Information about Red-Black Tree: Click here