阿摩線上測驗
6.If the longest path in a binary tree contained exactly four nodes, what is the minimum number of
nodes that could be in the entire tree?
(A) 4
(B) 5
(C)7
(D)8
(E) 15
答案：登入後查看
統計： A(3), B(0), C(1), D(2), E(0) #3081336
統計： A(3), B(0), C(1), D(2), E(0) #3081336
