☰
WH
·
CSBank
首頁
題庫專區
模擬考專區
Pro 方案
聯絡我們
首頁
題庫
模擬考
Pro
聯絡
總覽
資料結構
388
演算法
212
作業系統
290
計算機組織與結構
266
離散數學
161
線性代數
182
資料結構
›
Ch9 進階樹
第 78 題／共 88 題
◀
DS 78/88
錯題回報
00:00
78. Trie、Digital Search Tree、Compressed Trie、Patricia
#DS-09-078
易
Trie
Digital Search Tree
Compressed Trie
Patricia
📝
☆
[5%] Please identify which of the following statement(s) is (are) true.
A
Tries outperform digital search trees in terms of the number of comparison operations performed.
B
Compared with tries, compressed tries take less storage overheads.
C
Patricia outperforms compressed tries in terms of storage overheads.
D
Both Patricia and digital search trees take the identical complexity of storage overheads.
E
Patricia outperforms digital search trees in terms of the number of comparison operations performed.
📝 寫筆記
📄 成大112
重做
跳轉到第
題
← 上一題
下一題 →
答案／解析
▤
完整推導請見《WH 資工筆記 · 資料結構》Ch9 進階樹
‹
本章題號 · 61–80 / 88
›
全部 88
易 35
中 52
難 1
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
