In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is ............
A. log2 n
B. n/2
C. log2 n-1
D. n
Answer:D
In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is ............
A. log2 n B. n/2 C. log2 n-1 D. n