Red Black Trees

This data structure is one of my favorites from cs400

Here is a link to read more about them: link

1. Every node is red or black
2. The root node must be black
3. No red nodes can be parent or child of another red node
4. Every path from root to leaf must have the same number of black nodes