資料結構›Ch9 進階樹
第 76 題/共 88 題
◀ DS 76/88
76. Min-Max Heap
#DS-09-076中Min-Max Heap

[5%] Consider an Min-Max heap represented as an array [3,20,13,6,5,4,8,10,15,12,9,7][3, 20, 13, 6, 5, 4, 8, 10, 15, 12, 9, 7]. If we exchange any two values XX and YY in the array, which of the choices is (are) NOT Min-Max heap(s)?

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