A

Admin • 833.24K Points
Coach

Q. In worst case, the number of comparison need to search a singly linked list of length n for a given element is

  • (A) log n
  • (B) n/2
  • (C) log2n-1
  • (D) n

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.