(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, 4, 1, 3, 6, 9
A. 7, 4, 8, 1, 3, 6, 9
B. 7, 4, 8, 1, 6, 3, 9
C. 7, 4, 8, 1, 6, 9, 3
D. 7, 4, 1, 3, 6, 8, 9
I want to nisin the exam.
8
