"Among balanced search trees, AVL and 2/3 trees are now passé, and red-black trees seem to be more popular.
A particularly interesting self-organizing data structure is the splay tree, which uses rotations
to move any accessed key to the root." - Skiena
Implement
Splay tree: insert, search, delete functions
Red-black tree: Search and insertion functions, skipping delete