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 and III only
B) II only
C) II and III only
D) I only
Correct Answer:

Verified
Correct Answer:
Verified
Q65: Consider the following tree diagram: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB7392/.jpg"
Q66: If the postorder traversal of an expression
Q67: Consider the following Huffman encoding tree: <img
Q68: A completely filled binary tree with a
Q69: Consider the following tree diagrams: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB7392/.jpg"
Q71: Which of the following statements about trees
Q72: Consider the following tree diagram: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB7392/.jpg"
Q73: A balanced binary tree with 260 nodes
Q74: If both of the child references of
Q75: Consider the following tree diagrams: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB7392/.jpg"