Multiple Choice
Which action(s) will invalidate a min-heap so that, it may no longer have the properties of a min-heap?
I change the value of the root node
II remove the lowest level, right-most node
III remove the lowest level, left-most node
A) III
B) I and II
C) II and III
D) I and III
Correct Answer:

Verified
Correct Answer:
Verified
Q92: You wish to traverse a binary search
Q93: If we have a heap with n
Q94: Consider the following tree diagrams: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB7390/.jpg"
Q95: Removing an element from a balanced binary
Q96: Adding an element to an unbalanced binary
Q98: Given the BinarySearchTree and Node classes discussed
Q99: Consider the following binary search tree diagram:
Q100: Given the MinHeap class discussed in section
Q101: Which of the following is NOT a
Q102: Consider the following tree diagrams: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB7390/.jpg"