Hands-on C Tutorial (Part 4) : Converting Binary Search Trees to Red-Black Trees

This is the last video in this series. We convert the Binary Search Trees implemented in previous video into Red-Black trees. This change gives us guaranteed O(log(n)) performance, which is awesome achievement!
We first discuss and implement properties and insertion algorithm for general Red-Black trees, and then we integrate this code into our project and see its result.