試卷名稱:109年 - 108 國立中山大學_碩士班招生考試_電機系(丙組):資料結構#124087
年份:109年
科目:中山◆電機◆電磁學
6. Let the height of a tree be the number of nodes along the longest path from the root node to the leaf nodes. Consider the integers 30, 41, 25, 29, 94, 37, 70, 23, 65, 75, 68, 67 in order to create a binary search tree. Which of the following is true?
(A) The node for 37 is a leaf node;
(B) The root node is 41;
(C) The node for 70 has only one child;
(D) The height of the tree is 5.