benchmarks.wiki / Public workspace

MMLU-Pro / 10755 / A "strictly binary tree" is a binary tree in which every node that is not a leaf…

Problem

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

question

A "strictly binary tree" is a binary tree in which every node that is not a leaf has two children. Suppose that for a class of strictly binary trees there exists c > 0 such that, for any tree in the class, the ratio of the lengths of any two root-to-leaf paths is bounded above by c. Which of the following best characterizes the height h of any tree in this class, where N is the number of nodes in the tree and N > 1 ?

category

computer science

options

  1. h <= log2(N)
  2. h = log2(cN)
  3. h > c log2(N)
  4. h < 1/c * log2(N)
  5. h < c log2(N)
  6. h > log2(N)
  7. h <= c log2(N)
  8. h > log2(cN)
  9. h = c log2(N)
  10. h = 1/c * log2(N)

src

ori_mmlu-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