In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is-

In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is-

  1. a) log₂ n
  2. b) n/2
  3. c) n
  4. d) log₂ n − 1

From the Combined Bank Officer (IT) October 2024 – Preliminary (BIBM) exam, question 69 of 95.

More from this paper