申論題 - 阿摩線上測驗

申論題資訊

試卷：102年 - 102 國立交通大學_碩士班考試入學試題_資訊聯招：資料結構與演算法#113274
科目：交大◆資工◆資料結構與演算法
年份：102年
排序：0

題組內容

6. (5%) You have the following data structures A. list, B. hash table, and C. AVL tree at your disposal. Assume you have a lot of data in the form of key-value pairs ＜key1,value1＞, ＜key2,value2＞, ,＜keyN,valueN＞. Please answer the following questions by making your choices from the three data structures:

申論題內容

(3). If we want to emulate a priority queue, which of the three data structures will be the best choice (i.e. both element addition and extract-max have to be efficient) _____.