CS 400 Red Black Tree

This is the homepage for the CS 400 Red Black Tree topic.

Red Black Tree properties

1. Each node is either red or black.
2. The root is always black.
3. All leaves (null nodes) are black.
4. If a red node has children, then, both its children must be black (no two red nodes can be adjacent).
5. Every path from a node to its descendant null nodes must have the same number of black nodes.

Other resources

• Red-Black Tree - Wikipedia
• Red Black Tree | Set 1 (Introduction) - GeeksforGeeks