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:
Verified
Q83: Insert the missing code in the following
Q84: Which of the following statements about inserting
Q85: Consider the following binary search tree:
Q86: If the postorder traversal of an expression
Q87: If the postorder traversal visits the nodes
Q89: If the postorder traversal visits the nodes
Q90: What is the efficiency of adding an
Q91: Which of the following statements about inserting
Q92: What is the efficiency of locating an
Q93: A min-heap is a binary tree structure
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