(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. 1. 8. 2. 7, 4, 5
B. 6. 1, 7, 2, 8, 5, 4
C. 6, 2, 7, 1, 4, 8, 5
D. 6, 2, 8, 1, 4, 7.5
6
3
8
1
4
7
2
5
35
