資料結構›Ch9 進階樹
第 31 題/共 88 題
◀ DS 31/88
31. Fibonacci Heap
#DS-09-031中Fibonacci Heap

Consider a Fibonacci heap that results from successively inserting 929 (distinct) keys into an initially empty heap, followed by deleting the minimum key. Which of the following statements are true?

📄 台大110
跳轉到第題
▤完整推導請見《WH 資工筆記 · 資料結構》Ch9 進階樹
本章題號 · 21–40 / 88