問題詳情
37. Which of the following statements are true?
(A) Stack implements a FIFO (first-in-first-out) policy.
(B) Queue implements a LIFO (last-in-first-out) policy.
(C) Stack can be realized by deque (double-ended qucue).
(D) The Find() operation in a doubly linked list takes O(n) time.
(E) The EnqueueO operation in a queue takes O(1) time.
參考答案
答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增