ALL GATE QUESTIONS SUBJECTWISE



GATE 2002 Question - Mark 1

In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is
(a) log2 n
(b) n/2
(c) log2 n − 1
(d) n


Total 2 Questions



Share: