7.Splay

This section explains the concept, its importance, and when to use it.

7.Splay

SPLAY TREE

Type of a binary search tree

Rotations:

It is like a standard BST search operation

The given node X is a right child of a left child

The given node X is left child of a left child

We have to repeat the previous two steps over and over again until we get to the root

EXAMPLE

It is exactly the same as inserting a node into a BST