+1 vote
in Data Structures & Algorithms I by (110k points)
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 Answer

+1 vote
by (737k points)
selected by
Best answer
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.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.