Why Red-Black Trees are Awesome?
In this video, Yechao Lin (Tony) talks about a popular data structure: Red-Black tree. First, Tony will provide a brief introduction of Red-black tree, the properties it has, and the five basic coloring rules of this data structure. Next, he will also show the fundamental invalid red-black tree cases and how to fix it using simple tree operations. Lastly, he will dive deep into red black tree insertion and how to achieve self balancing structure following its basic coloring rules.
Project Members: Yechao Lin (Tony)