Q87
If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.
If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.
A.
2
AnswerB.
100
C.
17
D.
3
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board