資料結構›Ch7 搜尋與排序
第 40 題/共 76 題
◀ DS 40/76
40. Max Heap、Pop Operation
#DS-07-040中Max HeapPop Operation

(3%) There is a max binary heap with height h, where h >= 2. The height of the root is 0. The pop operation is used to remove an element. After 15 elements are stored to the heap, the new height of the heap is H. The function ceil(x) returns the smallest possible integer value which is greater than or equal to the given argument x. Which of the following statement(s) is(are) correct?

📄 交大112
跳轉到第題
▤完整推導請見《WH 資工筆記 · 資料結構》Ch7 搜尋與排序
本章題號 · 21–40 / 76