49. Suppose there is a binary tree containing nodes M, N, O and P, and each node has at most one child node. How many terminal nodes are there in this binary tree?
(A) 4
(B) 1
(C) 2
(D) 3

答案:登入後查看
統計: A(4), B(6), C(16), D(5), E(0) #3112233

詳解 (共 2 筆)

#5839378
假設有一棵包含節點 M、N、O 和 P ...
(共 181 字,隱藏中)
前往觀看
2
0
#7226448
這是一道關於 資料結構(Data Str...
(共 1802 字,隱藏中)
前往觀看
0
0