ProGrads 卷別
資料結構與演算法
選擇國立中興大學 2025 · 考試 · 第 13 題
考科資料結構
(3 points) If you have a binary search tree (BST) containing the numbers 1 through 100, which element's search time would be the shortest (assuming balanced distribution)?
- (A)1
- (B)50
- (C)100
- (D)75
← 回題庫