As you can see, it is very similar to a Binary Search tree. The key difference is that the nodes can either be red or black. Depending on these colors, the insertion and deletion of these nodes can cause the properties of the tree to be violated.
Begin Learning