(1) Build a binary search tree for the input sequence 12, 5, 7, 18, 19, 15, 14, 6, 13. It is assumed that
the tree root is on level 1.
(A) There are five levels in the tree.
(B) 14 is on level 3.
(C) If we want
to search 16, the number of required node comparisons is 3.
(D) The subtree rooted at 15 has 3
nodes (including 15).
阿摩線上測驗
登入