Both children of each red node are black. Every path from a given node to any of its descendant NIL nodes contains the same number of black nodes. We could only keep binary search tree almostly ...

RedBlackTree supports value-based lookup, positional lookup, or a combination of both, depending on how you configure its key type, RedBlackKey. For example, you can create a single red-black tree ...