Question: In the worst case, the number of comparisons needs to search a node in a singly linked list of length n is having time complexity.
In the worst case, the number of comparisons needs to search a node in a singly linked list of length n is having time complexity.
A. log n
B. n
C. log2n-1
D. n/2
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
