A Min-Heap Is a Binary Tree Structure in Which Missing

question 44

Multiple Choice

A min-heap is a binary tree structure in which missing nodes may only occur where?

• A) bottom level, left side
• B) bottom level, right side
• C) anywhere in the bottom two levels
• D) left child of the root

---

Definitions:

Bell-Shaped

Describes the symmetric shape of a distribution that is highest in the middle and tapers off towards both ends, characteristic of a normal distribution.

Tchebysheff's Theorem

A statistical rule stating that for any set of data, regardless of distribution, a certain percentage of values will fall within a specific number of standard deviations from the mean.

Tchebysheff's Theorem

A statistical theorem stating that for any set of data, the proportion of results that lie within a certain number of standard deviations from the mean is at least 1-1/k^2, for k>1.

Z Score

A Z score, or standard score, is the number of standard deviations an observation is from the mean, used in statistics to compare observations from different datasets.