title: How does a red-black tree work?
body: <p>There are lots of questions around about red-black trees but none of them answer how they work.  Why is it called red-black?  How does this keep the tree balanced (thus increasing performance over an unbalanced normal binary search tree)?  I'm just looking for an overview of how and why it works.</p>