If a min-heap has 14 nodes, what is known for certain when we add a new node?
i.every level of the tree will be fully occupied
II.the tree does not grow a new level
III.the root contains the smallest element
A) I only
B) I and III only
C) I and II only
D) I, II and III
Correct Answer:
Verified
Q80: If the postorder traversal of an expression
Q81: Insert the missing code in the following
Q82: What is the efficiency of adding an
Q83: What is the efficiency of removing an
Q84: What is the efficiency of locating an
Q86: If a min-heap has 1024 nodes, what
Q87: What is the complexity of removing an
Q88: Which of the following statements about a
Q89: When we map a min-heap with n
Q90: What is the complexity of adding an
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents