5
2
6
1
4
8
3
7
(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 root (node 5)?
A. 2, 1, 4, 3, 6, 8, 7
B. 4, 2, 6, 1, 3, 7, 8
C. 4, 2, 6, 1, 3, 8, 7
D. 2, 1, 4, 3, 6, 7, 8
