37
Multiple choices 37/50
(Choose 1 answer)
Next
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):
6, 7, 3, 1, 2, 5, 8
A. 6, 3, 7, 1, 5, 8, 2
B. 6, 3, 7, 1, 5, 2, 8
C. 6, 3, 1, 2, 5, 7, 8
D. 6, 3, 7, 1, 2, 5, 8
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45 46
47
48
49
50
