6
3
7
1
4
8
2
5
(Choose 1 answer)
Given a binary search tree T below. What is a result of breadth-first traverse of T after you delete by merging the node 3?
A. 6. 2, 7, 1, 4, 8, 5
B. 6, 1, 7, 2, 8, 4, 5
C. 6, 2, 7, 1, 4, 5, 8
D. 6, 1, 7, 2, 8, 5, 4
18/50-CAP
ORi
Q: 20
