資料結構›Ch9 進階樹
第 58 題/共 88 題
◀ DS 58/88
58. Fibonacci Heap、Decrease-Key、Cascading Cut
#DS-09-058中Fibonacci HeapDecrease-KeyCascading Cut

[5%] Given an initial empty Fibonacci heap (F heap). After a sequence of insertion operations and delete-min operations, the Fibonacci heap becomes as follows:

Then, please proceed to perform operations in the following order: decrease the key 14 by 5, decrease the key 21 by 14, delete the key 12, insert the key 14, delete the minimum key. Considering these operations, which of the following statements is true?

題目附圖
📄 成大113
跳轉到第題
▤完整推導請見《WH 資工筆記 · 資料結構》Ch9 進階樹
本章題號 · 41–60 / 88