Q79
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
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board