Data Structures | Linked List | Question 9

Last Updated :
Discuss
Comments

In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is

log(2*n)

n/2

log(2*n) -1

n

This question is part of this quiz :

Top MCQs on Linked List Data Structure with Answers,Top 50 Data Structures MCQs with Answers
Tags:
DSA Quiz
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy