Multiple choice

Which structure is more amenable for searching?

  1. Binary tree

  2. Singular linked list

  3. Double linked list

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

Binary trees, specifically balanced ones, allow for O(log n) search time, which is significantly faster than the O(n) linear search required for linked lists or unsorted arrays.

Keep practicing — related questions