☰
WH
·
CSBank
首頁
題庫專區
模擬考專區
Pro 方案
聯絡我們
首頁
題庫
模擬考
Pro
聯絡
總覽
資料結構
388
演算法
212
作業系統
290
計算機組織與結構
266
離散數學
161
線性代數
182
資料結構
›
Ch4 鏈結串列
第 14 題／共 22 題
◀
DS 14/22
錯題回報
00:00
14. Linked List、Queue、Deque、Time Complexity
#DS-04-014
易
Linked List
Queue
Deque
Time Complexity
📝
☆
Assume that we have a data structure S that contains n elements with
n
>
0
n>0
n
>
0
. Which of the following statement(s) is(are) true?
A
(A) Let S be a linked list with its elements required to be ordered in ascending order. It takes
O
(
1
)
O(1)
O
(
1
)
time to insert a new element into S.
B
(B) Let S be a queue. It takes
O
(
n
)
O(n)
O
(
n
)
time to remove all the elements one by one from S.
C
(C) Let S be a double-ended queue which is implemented as a doubly linked list and supports insertion and deletion from both ends. It takes
O
(
1
)
O(1)
O
(
1
)
time to add an element to the back of S and
O
(
1
)
O(1)
O
(
1
)
time to find an element of S.
D
(D) Let S be a doubly linked list. Given a node of S, it takes
O
(
n
)
O(n)
O
(
n
)
time to delete the node from S.
📝 寫筆記
📄 交大110
重做
跳轉到第
題
← 上一題
下一題 →
答案／解析
▤
完整推導請見《WH 資工筆記 · 資料結構》Ch4 鏈結串列
‹
本章題號 · 1–20 / 22
›
全部 22
易 19
中 3
難 0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
