 For many sequences of non-random operations, splay trees perform better than other search trees, even when the specific pattern of the sequence is unknown.The splay tree was invented by Daniel Sleator and Robert Tarjan in 1985.All normal operations on a binary search tree are combined with one basic operation, called "splaying".