卷別
資料結構與演算法
選擇國立中興大學 2025 · 考試 · 第 11 題
考科資料結構
(3 points) Which of the following operations typically takes time in an array-based stack implementation?
- (A)Pushing an element onto the stack
- (B)Searching for a specific element in the stack
- (C)Removing an element from the bottom of the stack
- (D)Reversing the entire stack