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