PA of Algorithms Q31

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

Option : D
Explanation :
The worst case number of comparison is n. to search any element from singly link list.

Forgot your password?

I agree with the Terms.