☰
WH
·
CSBank
首頁
題庫專區
模擬考專區
Pro 方案
聯絡我們
首頁
題庫
模擬考
Pro
聯絡
總覽
資料結構
388
演算法
212
作業系統
290
計算機組織與結構
266
離散數學
161
線性代數
182
資料結構
›
Ch5 樹狀結構
第 12 題／共 48 題
◀
DS 12/48
錯題回報
00:00
12. Tree性質
#DS-05-012
中
Tree性質
📝
☆
（複選）Which of the following statement(s) about the tree data structure is (are) correct?
A
(Number of edges) = (Number of nodes) - 1
B
(Number of leaf nodes) = (Number of internal nodes) + 1 // Note: Leaf nodes are those with no child node. Nodes that are not leaf nodes are internal nodes.
C
(Number of paths from the root to the leaf nodes) is O(Number of leaf nodes).
D
(Height of a tree) is
Ω
(
log
(
Number of nodes
)
)
\Omega(\log(\text{Number of nodes}))
Ω
(
lo
g
(
Number of nodes
))
.
E
(Number of subtrees) =
O
(
(
Number of nodes
)
2
)
O((\text{Number of nodes})^2)
O
((
Number of nodes
)
2
)
// A subtree
T
s
T_s
T
s
of a tree T is a tree formed by a subset of nodes in T and with the edges that connect these nodes.
📝 寫筆記
📄 台大112
重做
跳轉到第
題
← 上一題
下一題 →
答案／解析
▤
完整推導請見《WH 資工筆記 · 資料結構》Ch5 樹狀結構
‹
本章題號 · 1–20 / 48
›
全部 48
易 34
中 14
難 0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
