題組內容

3. Answer the following questions with either true or false. Assume there are n elements in the
data structure.

d. One can implement a stack (of unbounded size) based on an array so that each individual
push/pop operation is time O(1). (4%)