Splay Tree. What makes the splay tree special is its ability to access recently accessed elements faster. ● properties of splay trees.

Inserts a node into the splay tree.

● splay trees provide make it extremely easy to perform the following operations When a node x is accessed, we perform a sequence of splay steps to move x to the root. Briefly, i try to implement the splay tree according to algorithm storing the nodes in the access path in a stack (thepath) as i go up. Splay trees put the most recently accessed items near the root based on the principle of locality;