← 回題庫

卷別

資料結構與演算法

選擇

國立中興大學 2025 · 考試 · 第 11 題

(3 points) Which of the following operations typically takes O(1)O(1) 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

標準解析

AI 已複查