A min-heap is a binary tree structure in which missing nodes may only occur where?
A)bottom level, left side
B)left child of the root
C)bottom level, right side
D)anywhere in the bottom two levels

Question

Quizplus · Accepted Answer

In a min-heap, the missing nodes can only occur in the last level to the right side as the heap is a complete binary tree. Therefore, choice C is the correct answer.

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