Multiple Choices
(Choose 1 answer)
What is the result of the breadth first traverse of the binary search tree T, after inserting the following keys into the tree sequentially (suppose T is empty before insertion):
7, 8, 3, 1, 2, 5, 9
A. 7, 3, 8, 1, 2, 5, 9
B. 7, 3, 8, 1, 5, 2, 9
C. 7, 3, 1, 2, 5, 8, 9
D. 7, 3, 8, 1, 5, 9, 2
၁ C
