Answer (Choose 1 answer)
Given a binary search tree T below. What is a result of breadth-first traverse of T after you delete by copying the root (node 5)?
A. 2, 1, 4, 3, 7, 6, 8
B. 4, 2, 7, 1, 3, 6, 8
C. 2. 1. 4. 7. 3, 6, 8
D. 4. 2, 7, 1, 6, 8, 3
5
2
7
1
4
6
8
3
Ex
5
