Since a heap is a complete tree, there is only one correct location for the insertion of a new node, and that is either the next open position from the left at level h or the first position on the left at level h+1 if level h is full.
A) Minheap
B) Maxheap
C) Balanced tree
D) Complete tree

Question

Quizplus · Accepted Answer

The statement describes a characteristic of a complete tree, where every level, except possibly the last, is completely filled, and all nodes are as far left as possible. This property ensures a unique location for new node insertions, making it applicable to both minheaps and maxheaps, as they are both complete trees by definition.

Since a Heap Is a Complete Tree, There Is Only