Exam-style question
Try this first
Which statement describes the time complexity required for binary tree search in this specification?.
- A.O(1)
- B.O(log n)
- C.O(n)
- D.O(n²)
Model answer
What a good answer should say
- B.
- O(log n)
Explanation
Why this works
The required time complexity for binary tree search is O(log n).
Common mistake
No common mistake is linked to this question yet.