https://www.youtube.com/watch?v=qvZGUFHWChY
https://www.youtube.com/watch?v=5IBxA-bZZH8
https://www.youtube.com/watch?v=95s3ndZRGbk
https://www.youtube.com/watch?v=A3JZinzkMpk
Red Black tree is a special type of balanced search trees.
In a balanced Search tree it is guaranteed that the heigth is O (log n) fir n items.
Criteria for Red Black Trees:
- A node is either red or black.