題組內容

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

e. One can implement a stack based on a linked list so that each individual push/pop
operation is time O(1). (4%)