題組內容

4. [Advanced Data Structures: ]61e64dad46858.jpg

(2) Consider a Fibonacci heap as follows: The number in each node indicates its key value. Suppose that we decrease key 48 to 17 and then decrease key 37 to 7. Please show the final result of the revised heap.