Solved

If a Min-Heap Has 15 Nodes, What Is Known for Certain

Question 73

Multiple Choice

If a min-heap has 15 nodes, what is known for certain?
I every level of the tree is fully occupied
II at least one level is missing a node
III the root contains the smallest element


A) I
B) II
C) I and III
D) II and III

Correct Answer:

verifed

Verified

Unlock this answer now
Get Access to more Verified Answers free of charge

Related Questions

Q11: Which of the following statements about a

Q17: You wish to traverse a binary search

Q69: Given the BinarySearchTree class discussed in section

Q70: Consider the following tree diagrams: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB7390/.jpg"

Q71: Consider the following tree diagram: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB7390/.jpg"

Q74: A binary search tree is made up

Q75: Consider the following binary search tree diagram:

Q76: How many times during the heapsort algorithm

Q77: Consider the following tree diagrams: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB7390/.jpg"

Q78: Consider the following tree diagrams: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB7390/.jpg"