I implemented a Red-Black tree (part 1)

[928 words]

A Red-Black tree is a binary search tree (BST) that takes some action to try and keep itself balanced. We know that BSTs are great at storing nodes identified by some key for which an order relationship exists (e.g., integers). They have the property that the values in the left sub-tree of each node n have keys smaller-than n‘s key n.k, and those in the right sub-tree have keys greater-than n.k1.

Read More