Respuesta :

MathPhys

Answer:

17

Explanation:

For a binary tree with h levels, the maximum number of nodes is 2ʰ − 1.

2ʰ − 1 ≥ 100,000

2ʰ ≥ 100,001

h ≥ log₂ 100,001

h ≥ 16.6

The smallest number of levels required to store 100,000 nodes is 17.

Otras preguntas