benchmarks.wiki / Public workspace

MMLU / In a height-balanced binary search tree, the heights of the left and right…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

question

In a height-balanced binary search tree, the heights of the left and right descendents of any node differ by at most 1. Which of the following are true of such a tree?
I. Worst-case search time is logarithmic in the number of nodes.
II. Average-case search time is logarithmic in the number of nodes.
III. Best-case search time is proportional to the height of the tree.
IV. The height of the tree is logarithmic in the number of nodes.

choices

  1. I and III only
  2. II and III only
  3. II and IV only
  4. I, II, and IV

subject

college_computer_science

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

Official source

initial import