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
詳解 (共 2 筆)
未解鎖
假設有一棵包含節點 M、N、O 和 P ...
未解鎖
這是一道關於 資料結構（Data Str...
阿摩線上測驗
登入
