JAVA

The largest key in a heap-ordered binary tree is found at the leftmost leaf.

Question 1 options:

	True
	False

Question 2 (1 point)

"restoring heap order" is known as

Question 2 options:

	Reheapifying
	Restorifying
	Heaponification
	Reheapallocation

Question 3 (1 point)

In a max-oriented heap, a key that is swimming will be swapped with its parent whenever the parent is smaller.

Question 3 options:

	True
	False

Question 4 (1 point)

Give the sequence of the 13 keys in the array that results after inserting the sequence of 3 keys

1 9 6 

into the following maximum-oriented binary heap of size 10:

12 11 3 8 10 0 2 4 5 7 

Enter you answer as a sequence of numbers separated by a single space. Do not put spaces at the beginning or the end of your answer. Do not include any punctuation!

Question 5 (1 point)

Give the sequence of the 7 keys in the array that results after performing 3 successive delete-the-max operations on the following maximum-oriented binary heap of size 10:

9 8 7 5 6 0 2 1 4 3 

Enter you answer as a sequence of numbers separated by a single space. Do not put spaces at the beginning or the end of your answer. Do not include any punctuation!

Question 6 (1 point)

Give the array that results immediately after completing the first phase of heapsort (heap construction) on the following array of 10 keys:

7 4 2 3 5 8 1 6 9 0 

Your answer should be a heap.

Enter you answer as a sequence of numbers separated by a single space. Do not put spaces at the beginning or the end of your answer. Do not include any punctuation!

Question 7 (1 point)

An array that is sorted in decreasing order a max-oriented heap.

Question 7 options:

	True
	False