Red Black Tree Insertion

The same as BST insertion, but nodes are given a red or black color afterwards. takes $O\log (n)$ time

Process

1. Insert via BST