問題詳情
9. The pre-order traversal of a binary search tree (BST) is 26, 20, 15, 19, 24, 22, 48, 36, 30, 64 and its in-order traversal is 15, 19,20, 22,24, 26, 30, 36, 48, 64. When the element to be deleted is in a nonleaf node that has two children, the element is replaced by the largest element in its left subtree.
【題組】(25) When a key value 37 is inserted into the BST, what is the 6th key value in the post-order traversal of the updated BST?
(A)24
(B)37
(C) 30 )
(D)26
(E) None of the above
參考答案
答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增