The Following Are Notes on Understanding Red Black Trees, a special category of Binary Search Trees that ensure the tree stays Balanced. In other words, Red Black Trees ensure
that the height of the tree is always O(log n) where n is the number of nodes in the tree. This is important because it ensures that the time complexity of operations like search, insert, and delete are O(log n) which is the best time complexity we can achieve for these operations in a Binary Search Tree.

For this, we assume you have a solid understanding of Binary Search Trees, check the reference for a refresher: