Tree Properties

• Tree is a valid binary search tree
• All nodes are either red or black
• The root is black
• All leaves are black
• Every red node has two black children
• Every path from root to leaf contain the same number of black nodes

Instructions

• Switch node colors by clicking on the small circle above the node.
• Make a tree rotation by clicking on the arrows.
• When clicking Insert Node, the program will insert the new node according to a normal Binary Search Tree insertion, but it is up to you to modify the tree to refulfill all the red-black tree properties.
• The property states above will be updated after every modification to the tree.
• There are five cases in the red-black tree node insertion that need to be handled differently. For a demonstration using this application, watch this video.