Answer (Choose 1 answer)
Root
40
30
50
25
35
45
60
Given a binary search tree as follows:
What would be the output of Pre-order traversal?
A. 25, 30, 35, 40, 45, 50, 60
B. 40, 30, 25, 35, 50, 45, 60
C. 40, 30, 50, 25, 35, 45, 60
D. 25, 35, 30, 45, 60, 50, 40
Exit (40
