(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):
19, 11, 6, 4, 15, 23, 20
A. 19, 11, 23, 6, 3, 15, 20
B. 19, 11, 23, 6, 15, 4, 20
C. 19, 11, 23, 6, 15, 20, 4
D. 19, 11, 23, 6, 20, 4, 15
25
