In the Worst Case, a General Binary Search Tree Could

question 11

Multiple Choice

In the worst case, a general binary search tree could require __________________ comparisons to find an element.

• A) O(1)
• B) O(n)
• C) O(2ⁿ)
• D) O(log₂ n)
• E) none of the above

---

Definitions:

Geegaws

Fancy but ultimately useless objects, often decorative and lacking in practical utility.

Doodads

Informal term for gadgets or small items whose name is either unknown or forgotten.

Workbook Problems

Exercises or problems contained in a workbook aimed at practicing or testing knowledge in a particular subject.

Term Papers

Research papers usually required at the end of a semester or term in schools and colleges, as part of the assessment.