☑Kizspy.me
(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
☐ C
A. 2, 1, 4, 3, 6, 7, 8
☐ D
B. 4, 2, 6, 1, 3, 7, 8
C. 2, 1, 4, 3, 6, 8.7
D. 4, 2, 6, 1, 3, 8.7
Back
Next
FUO.sh
sh the exam.
3
4
7
8
