+1 vote
in Data Structures & Algorithms I by (110k points)
In which of the following self – balancing binary search tree the recently accessed element can be accessed quickly?

(a) AVL tree

(b) AA tree

(c) Splay tree

(d) Red – Black tree

This intriguing question originated from Binary Trees in section Binary Trees of Data Structures & Algorithms I

The question was asked during an online exam.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Right answer is (c) Splay tree

For explanation: In a Splay tree, the recently accessed element can be accessed quickly. In Splay tree, the frequently accessed nodes are moved towards the root so they are quick to access again.

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.