Red Black Trees

Red Black Trees are a node data structure that initally behaves very similarly to a regualar Binary Search Tree,
except Red Black Trees follow a peculiar set a rules that allow it to keep it's nodes organized.

Rules of Red Black Trees

• All Nodes must either be Red or Black
• Red Node cannot have red children
• Null path lengths must be equal
• Root node must be black