(Choose 1 answer)
6, 7, 3, 1, 2, 5, 8
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):
A. 6, 3, 7, 1, 5, 8, 2
B. 6, 3, 7, 1, 5, 2, 8
C. 6, 3, 1, 2, 5, 7, 8
D. 6, 3, 7, 1, 2, 5, 8
14/50-CAP
Osh
Q: 16
