benchmarks.wiki

benchmarks.wiki / Public workspace

MMLU-Pro / 10747 / What is the maximum number of entries that can be stored in a binary tree if the…

Problem

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

question

What is the maximum number of entries that can be stored in a binary tree if the longest path from the root to any node does not exceed N? Find the general equation for the aver-age search time for any entry in a tree with N levels.

category

computer science

options

  1. 2^(2N) - 1, (2N - 1) / (2^(2N) - 1)
  2. N^3, (log(N) + 1) / N
  3. 2^(N-1), (2N) / (2^(N-1))
  4. 2^(N+1) - 1, N / (2^(N+1) - 1)
  5. 2^N, N / (2^N)
  6. 2^N + 1, N / (2^N - 1) - 1
  7. 3^N - 1, log(N) / (3^N - 1)
  8. N!, (N^2) / (N!)
  9. 2^N - 1, N - 1 + (N / (2^N - 1))
  10. N^2 - 1, N + 1 - (N / (2^N - 1))

src

stemez-ComputerScience

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

upstream_id / Original problem ID
10747
task_id
234f0b97-f7eb-50f8-ab49-a3e059134b6b
task_key
default--test--10747
task_revision_id
1
config / split
default / test

Official source

initial import