問題詳情

6. A job priority queue is implemented using a Min-Heap in which a lower key value means a higher priority.The jobs are entered and stored in the Min-Heap as shown in the following array Q.


【題組】(16)Next job is extracted from the job queue for execution. What is the value of Q[4] in the remaining job queue?
(A) 15
(B)18
(C)20
(D).26
(E) None of the above

參考答案

答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增