Which of the following data structure is preferred to have lesser search time when the list size is small? Q & A › Category: Data Structure › Which of the following data structure is preferred to have lesser search time when the list size is small? 0 Vote Up Vote Down Admin Staff asked 4 years ago 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 Share this:TwitterFacebookWhatsAppPinterestLike this:Like Loading... 1 Answers 0 Vote Up Vote Down Admin Staff answered 4 years ago c) self organizing list Share this:TwitterFacebookWhatsAppPinterestLike this:Like Loading...