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

Question

Quizplus · Accepted Answer

In a min-heap, missing nodes can only occur on the bottom level, and they must be on the right side to maintain the complete binary tree property.

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