In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is?
A. log 2 n
B. n/2
C. log 2 n - 1
D. n
Answer: Option D
This Question Belongs to Data Structure >> Introduction To Data Structures
Related Questions on Introduction to Data Structures
A. A collection of data values
B. A programming language
C. A set of algorithms
D. A way of organizing and storing data
Join The Discussion