問題詳情
15. Let the height of a tree be the number of nodes along the longest path from the root node to theleaf nodes. Consider the integers 30, 41, 25, 29, 94, 37, 70, 23, 65, 75 in the specified order todevelop a binary search tree. Which of the following is TRUE?
(A) The node for 37 is an internal node.
(B) The root node is 41.
(C) The node for 70 has only one child.
(D) The height of the tree is 5.
(E) The node for 75 is a child of the node for 94.
參考答案
用户評論
【Tien Wu】評論
(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.