Chatting about data structures with colleagues, and one mentioned a "left-leaning red-black tree".
I guess in a left-leaning red-black tree, the algorithms ensure that every node receives a reasonable minimum amount of processing. Whereas in a right-leaning red-black tree, the nodes all just get to compete with each other in a free market.
