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.
|Answer» A. 2|
Login to Continue
It will take less than 2 minutes