RedBlackTrees in CS400!

This page goes over some interesting facts and useful information about red-black trees.

• Red-black trees must adhere to a few rules - one of which is that the root node must be black.
• Red-black trees are self-balancing; that means just following its repair operations will keep each subtree of each node balanced.
• When implementing red-black trees, try using recursion! A binary tree's structure is perfect to use recursion on, given a binary tree's fractal nature.

Here's a diagram on rbt insertion repair operations.