Min/Max Heap Quiz Online Practice Test

1. A descending priority queue can be implemented using:

2. A min heap can be used to implement selection sort.

3. The following procedure is used to maintain min-order in a min heap. Identify the missing statements, represented as X.

procedure TrickleDownMin(i)
if A[i] has children then
m := index of smallest of the children
or grandchildren (if any) of A[i]
if A[m] is a grandchild of A[i] then
if A[m] < A[i] then
swap A[i] and A[m]
X: _______________________
______________________
endif
TrickleDownMin(m)
endif
else // {A[m] is a child of A[i]}
if A[m] < A[i] then
swap A[i] and A[m]
endif
endif

4. The ascending heap property is defined as:

5. The time complexities for the procedures FindMin() and DeleteMin() in a min heap are:

6. Which of the following arrays represents a binary min heap?

7. To find the largest element in a binary min heap with n elements, the time complexity is:

8. A min heap always forms a complete binary tree.

9. In a max heap constructed from the elements 5, 70, 45, 7, 12, 15, 13, 65, 30, 25, the position of 5 will be: