Red-Black Tree
Binary Search Trees that are self balancing
Properties of A Valid 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.
Additional rule:
