In the worst case, the number of comparisons needs to search a node in a singly linked

Question:

In the worst case, the number of comparisons needs to search a node in a singly linked list of length n is having time complexity.

A. log n 

B. n 

C. log2n-1 

D. n/2

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: