Implementation of a hieght balanced splay tree with the following operations
- Splay(x): Do the splay operations and bring x to the root, Expected complexity O(log n)
- Search(x): search adding the splay operation, Expected complexity O(log n)
- Insert(x): insert adding the splay operation, Expected complexity O(log n)
- Delete(x)): delete adding the splay operation, Expected complexity O(log n)
- Print: Print the tree