Wikipedia: Red-Black Tree: a self-balancing binary search tree data structure noted for fast storage and retrieval of ordered information.
