9.5 Data Structures & Algorithms: Red-Black Trees 

A very very brief overview of another balanced binary tree, the Red-Black Tree. We focus on AVL Trees because they cover the relevant concepts and are a little simpler than Red-Black Trees, however Red-Black Trees have some better performance and are often the way libraries implement ordered collections, like Java's TreeMap.
Full course playlist at: • Data Structures & Algo...