☰
WH
·
CSBank
首頁
題庫專區
模擬考專區
Pro 方案
聯絡我們
首頁
題庫
模擬考
Pro
聯絡
總覽
資料結構
388
演算法
212
作業系統
290
計算機組織與結構
266
離散數學
161
線性代數
182
資料結構
›
Ch4 鏈結串列
第 16 題／共 22 題
◀
DS 16/22
錯題回報
00:00
16. Doubly Linked List、Merge、Sort
#DS-04-016
易
Doubly Linked List
Merge
Sort
📝
☆
Consider two doubly linked lists of integers, one has different member values from those of the other, show the correct one(s) below:
A
(A) When deleting an element with some value, the time complexity is
O
(
n
)
O(n)
O
(
n
)
.
B
(B) If these lists are sorted in the same order, the time complexity is
O
(
n
)
O(n)
O
(
n
)
when merging them.
C
(C) When sorting one of them (length n), the time complexity in the worst case is
O
(
n
2
)
O(n^2)
O
(
n
2
)
.
D
(D) When merging and sorting them, the time complexity in the worst case is
O
(
n
2
)
O(n^2)
O
(
n
2
)
.
E
(E) These lists can be constructed as a binary search tree in
O
(
n
)
O(n)
O
(
n
)
times in the worst case.
📝 寫筆記
📄 交大111
重做
跳轉到第
題
← 上一題
下一題 →
答案／解析
▤
完整推導請見《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
