Splay Tree Properties:
Amortized O(log n) per operation.
Recently accessed elements are near the root.
Working Set Theorem: accessing a small working
set of elements is very efficient.
Static Optimality: within a constant factor of
the best static BST for any access sequence.
No extra balance info stored per node.