Question: 25
(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):
16, 7, 3, 1, 12, 20, 17
A. 16, 7, 20, 3, 12, 1, 17
B. 16, 7, 20, 3, 17, 1, 12
C. 16, 7, 20, 3, 17, 12, 1
D. 16, 7, 20, 3, 12, 17, 1
