1. Multiple-choice questions ( each subquestion deserves ):There may be ZERO or MORE correct answers in each subquestion. If there is no correct answer,please give the answer "None"
【題組】(1) Build a binary search tree for the input sequence 12, 5, 7, 18, 19, 15, 14, 6, 13. It is assumed thatthe tree root is on level 1.
(A) There are five levels in the tree.
(B) 14 is on level 3.
(C) If we wantto search 16, the number of required node comparisons is 3.
(D) The subtree rooted at 15 has 3nodes (including 15).