+1 vote
in Data Structures & Algorithms I by (110k points)
Which of the following data structure is preferred to have lesser search time when the list size is small?

(a) search tree

(b) sorted list

(c) self organizing list

(d) linked list

This intriguing question comes from Types of Lists topic in chapter Types of Lists of Data Structures & Algorithms I

I had been asked this question during an interview.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Correct answer is (c) self organizing list

The best explanation: Self-organizing list is easy and simple to implement than search tree and it requires no additional space. So using self organizing list is preferred when list size is small.

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.

Categories

...