資料結構›Ch7 搜尋與排序第 55 題／共 76 題
55. Max Heap、Array Representation、Extract Max
#DS-07-055易Max HeapArray RepresentationExtract Max
- Assume we use an array A=[94, 23, 82, 11, 19, 2, 3, 4, 9, 15, 17] to keep a max-heap such that the parent node of A[k] is and A[0] = 94. After we extract the largest 6 elements from the max-heap. Which of the following elements will remain in the array?
📄 交大111
▤完整推導請見《WH 資工筆記 · 資料結構》Ch7 搜尋與排序