申論題資訊
試卷:104年 - 104 淡江大學 轉學考 資料結構#52975
科目:研究所、轉學考(插大)-資料結構
年份:104年
排序:0
題組內容
4.(20%) Given an array-based binary heap where each node has a key smaller than or equal to any children. Suppose that the following keys are added in order to this empty min-heap:
申論題內容
b. If a removal-of-minimum operation is performed, what is the new content of the array?