Red Black Tree Insertion

Lists the Red Black Tree insertion algorithm

Insertion Steps

• Find where to place the node as a new leaf.
• If its new parent is red then start correction.
• Case 0: If the new node's uncle is red then switch the parent and the uncle's colors.
• Case 1:If the uncle is black then check if the new node creates a triangle.
• If it does then rotate it twice, once with its parent and another with the grandparent.
• Then: Flip the colors of the node and its original grandparent.
• Case 2: If a line is made then rotate the node with its parent, then flip their colors.