Implementing Red-Black Tree in Go — Part 1, The Search and Insert Operation

The root of the red-black tree is black The leaf is always black The black node can have either a black or red node. A simple path from a node to its descendant leaves always has the same number of black nodes. We will also keep a separate instance for each leaf, but that would be more memory-intensive.