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