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

1 Expert Approved Answer
Step: 1 Unlock

D Explanation In the w... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Data Structures and Other Objects Using Java Questions!