ProGrads 卷別
資料結構
選擇國立中央大學 2026 · 考試 · 第 24 題
If you want to find the top 100 students by scanning a list of scores, which of the following data structures will offer the best computational time?
- (A)min-heap sized 100
- (B)max-heap sized 100
- (C)balanced binary search tree such as AVL-tree with 100 nodes
- (D)sorted linked list sized 100
- (E)sorted array sized 100