資料結構›Ch7 搜尋與排序第 50 題／共 76 題
50. Max Heap、Build Heap、Insert、Delete
#DS-07-050易Max HeapBuild HeapInsertDelete
- A maximum binary heap (Max-Heap for short) is implemented in an array, starting with index 1. (In many programming languages, the array index starts at 0. In this case, we skip the first cell which has index 0. For example, [-,3,2,1] represents a Max-Heap where 3 is the root, 2 is the left child of 3, and 1 is the right child of 3. Since we don't use the first cell, it is marked as '-'.) Which of the following statement(s) is(are) correct?
📄 交大110
▤完整推導請見《WH 資工筆記 · 資料結構》Ch7 搜尋與排序