In the worst case, the number of comparisons needed to search a singly linked…

PYQ GATE 2002

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.

    log₂ⁿ - 1

  4. D.

    n

Attempted by 1834 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…