Question: In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is (GATE CS
In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is (GATE CS 2002)
A. log 2 n
B. n/2
C. log 2 n – 1
D. n\
Step by Step Solution
3.54 Rating (158 Votes )
There are 3 Steps involved in it
D Explanation In the w... View full answer
Get step-by-step solutions from verified subject matter experts
