☑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 merging the node 3?
☐ A
☐ C
A. 5, 2, 7, 1, 6, 8,4
☐ D
B. 5, 2, 7, 1, 4, 6, 8
C. 5, 1, 7, 6, 8, 2.4
D. 5, 1, 7, 2, 6, 8,4
Back
Next
FUQ.sh
sh the exam.
2
4
6
8
