Multiple choice technology architecture

Binary search algorithm can not be applied to

  1. sorted linked list

  2. sorted binary trees

  3. sorted linear array

  4. pointer array
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

Binary search requires O(1) direct access to the middle element, which is not possible in linked lists as they require sequential traversal. Binary search CAN be applied to sorted linear arrays (direct index access), sorted binary trees (balanced BSTs allow O(log n) access), and pointer arrays (also support direct access).

Keep practicing — related questions