Solved

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

Question 57

Multiple Choice

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

Related Questions

Q50: What is a linear implementation?

Q51: Which of the following is true about

Q52: A binary search tree implementation of a

Q53: If the item with a given search

Q54: The _ operation of the ADT table

Q55: The sorted reference-based implementation of the tableDelete

Q56: A priority queue orders its items by

Q58: What kind of implementation of the ADT

Q59: What is the effect of the assumption

Q60: In an array-based implementation of a heap,the