Question: 7 If we implement heap as min-heap, deleting root node (value 1) from the heap. What would be the values of the children of the

 7 If we implement heap as min-heap, deleting root node (value

7 If we implement heap as min-heap, deleting root node (value 1) from the heap. What would be the values of the children of the root node after heapfy if leaf node (value 100) is chosen to replace the root at start. 17 19 36 25 100 a) 3 and 19 b) 3 and 17 C) 2 and 7 d) 2 and 100 Bo brak

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!