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