I didn't realize you could implement a red-black tree with this little code.

The code shown here seems to indicate that insert has at least four cases, and delete has six: https://en.wikipedia.org/wiki/Red%E2%80%93black_tree

But the code I see here is very small: https://github.com/codr7/libcodr7/blob/master/source/codr7/r...

I guess it's not handling delete, which probably accounts for a lot of the difference.

EDIT: I see that it's implementing a left-leaning red/black tree. I see some caution about that approach here? Would love to get the author's opinion about this: http://read.seas.harvard.edu/~kohler/notes/llrb.html