Which of the following is the self-adjusting binary search tree?

Category: QuestionsWhich of the following is the self-adjusting binary search tree?
Editor">Editor Staff asked 1 month ago

Which of the following is the self-adjusting binary search tree?
 
(a) AVL Tree
 
(b) Splay Tree
 
(c) Top Tree
 
(d) Ternary Tree
 
My question is taken from Binary Trees in portion Binary Trees of Data Structures & Algorithms I
 
I had been asked this question during an online exam.

1 Answers
Editor">Editor Staff answered 1 month ago

Correct option is (b) Splay Tree
 
Best explanation: Splay tree is a self – adjusting binary search tree. It performs basic operations on the tree like insertion, deletion, loop up performing all these operations in O (log n) time.