A splay tree is a self-adjusting binary search tree with an additional property that recently accessed elements are quick to access again.

The splay tree uses in Lexicographic Search Tree, Data Compression, Encryption, Cache Implementation and more. The splay tree supports all the binary search operation with splaying. Splaying property rearranges the tree. The element is placed at the root of the tree.

Splay tree section explains how to implement the Splay tree and various applications related with Splay tree operation.

Data structure problems
157 Sply Tree Implementation
A splay tree is a self-adjusting binary search tree with the additional property that recently accessed elements are quick to access again. The splay tree has good performance during the average case and uses small memory compare than another tree.