用戶【Tien Wu】點評問題和點評內容

【評論主題】15. Let the height of a tree be the number of nodes along the longest path from the root node to the

【評論內容】

(A) node 37是leaf

(B) root node is 30.

(C) node 70 had two children.

(D) the height of tree is 5.

(E) node 75 is leaf without child.