☰
WH
·
CSBank
首頁
題庫專區
模擬考專區
Pro 方案
聯絡我們
首頁
題庫
模擬考
Pro
聯絡
總覽
資料結構
388
演算法
212
作業系統
290
計算機組織與結構
266
離散數學
161
線性代數
182
資料結構
›
Ch9 進階樹
第 34 題／共 88 題
◀
DS 34/88
錯題回報
00:00
34. AVL Tree、B-Tree、B+-Tree
#DS-09-034
中
AVL Tree
B-Tree
B+-Tree
📝
☆
(3%) Which of the following statement(s) is/are true?
A
(A) AVL tree, B-tree and B+-tree are search trees.
B
(B) B+-tree offers more efficient sequential data access (such as "searching all numbers that are greater than 10") than B-tree does.
C
(C) B-tree offers more efficient data search than B+-tree does.
D
(D) AVL tree outperforms B-tree and B+-tree in minimizing the number of disk access operations.
E
(E) Consider the case that the following numbers are sequentially inserted into an empty AVL tree.
100
,
80
,
60
,
40
,
50
,
65
,
70
,
75
,
64
100, 80, 60, 40, 50, 65, 70, 75, 64
100
,
80
,
60
,
40
,
50
,
65
,
70
,
75
,
64
In the resultant AVL tree, the right child of root is 70.
📝 寫筆記
📄 交大114
重做
跳轉到第
題
← 上一題
下一題 →
答案／解析
▤
完整推導請見《WH 資工筆記 · 資料結構》Ch9 進階樹
‹
本章題號 · 21–40 / 88
›
全部 88
易 35
中 52
難 1
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
