(Choose 1 answer)
Suppose the binary search tree T is made by inserting the following keys consequently: 7, 8, 9, 10, 4, 3, 6, 5 What is the result of breadth-first traverse of T?
A. 7, 4, 8, 6, 3, 9, 5, 10
B. 7, 4, 8, 3, 6, 9, 5, 10
C. 7, 8, 9, 10, 4, 3, 6, 5
D. 7, 6, 8, 3, 4, 9, 5, 10
Exit 20
