Question

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.

Answer 1

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.