Splay tree:

Splay tree is very efficient tree .

Splay Tree is like Binary Search Tree. It is also a self – adjusted tree in which every operation on an element rearrange the tree so that the element is placed at the root position of the tree.

Splay tree operations take O(Logn) time on average.

Splaying an element is the process of bringing it to the root position by performing suitable rotation operations.

“splaying” means any operations to be performed on tree.

Question:

Now we will make a splay tree with 1, 11, 3, 10, 8, 4, 6, 5, 7, 9, 2 

Answer: