Binary search algorithm can not be applied to
-
sorted linked list
-
sorted binary trees
-
sorted linear array
-
pointer array
A
Correct answer
Explanation
Binary search requires random access to elements to find the middle index efficiently (O(1)). Linked lists only allow sequential access (O(N)), making the standard binary search algorithm impractical and no faster than linear search.