資料結構›Ch9 進階樹
第 66 題/共 88 題
◀ DS 66/88
66. Fibonacci Heap、Leftist Heap、SMMH、Priority Queue
#DS-09-066易Fibonacci HeapLeftist HeapSMMHPriority Queue

(複選)[4%] A system needs a priority queue with: frequent meld(A, B), frequent delete-min, and occasional find-max. Please select all that are correct.

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