K
Multiple choices 29/50
(Choose 1 answer)
A 12, 11, 10, 9, 8, 7, 6, 5, 4, 3
B. 12. 11, 9, 7, 5, 6, 3, 4, 8, 10
C. 3, 5, 7, 6, 4, 9, 8, 12, 11, 10
D. 3, 4, 5, 6, 7, 8, 9, 10, 11, 12
10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
28 29 30 31 32 33 34 35 36 37 38 39 40 41 42
43 44 45 46 47 48 49 50
Suppose the numbers 10, 8, 4, 11, 6, 9, 3, 12, 7, 5 are inserted in that order into an initially empty binary search tree. The binary search tree uses the reversal ordering on natural numbers ie. 12 is assumed to be smallest and 3 is assumed to be largest. The in-order traversal of the resultant binary search tree is
8
