A heap in which the root contains the item with the smallest search key is called a ______.
A)minheap
B)maxheap
C)complete heap
D)binary heap

Name: A heap in which the root contains the item with the smallest search key is called a ______. A)minheap B)maxheap C)complete heap D)binary heap
Brand: Quizplus
Rating: 4.8 (31 reviews)

Question

Quizplus · Accepted Answer

A heap in which the root contains the item with the smallest search key is called a minheap. This is because the minimum element is always stored at the root of the heap. Therefore, option A is the correct choice.

A Heap in Which the Root Contains the Item with the Smallest