問題詳情
23. We sequentially insert the following numbers: 19, 4, 26, 2, 13, 25 into an initiallyempty binary search tree. What is the preorder traversal sequence of the resultingtree?
(A) 2,4,13,19,25,26
(B) 19,4,2,13,26,25
(C) 19,4,2,26,13,25
(D) 2,13,4,25,26,19
(E) 19,4,26,2,3,2
參考答案
答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增