Given a binary search tree with its preorder traversal sequence { 8, 2, 15, 10, 12, 21 }.…

题目

Given a binary search tree with its preorder traversal sequence { 8, 2, 15, 10, 12, 21 }. If 8 is deleted from the tree, which one of the following statements is FALSE? (3分)

A. One possible preprder traversal sequence of the resulting tree may be { 2, 15, 10, 12, 21 }
B. One possible preprder traversal sequence of the resulting tree may be { 10, 2, 15, 12, 21 }
C. One possible preprder traversal sequence of the resulting tree may be { 15, 10, 2, 12, 21 }
D. It is possible that the new root may have 2 children

答案：C

知识点

题目考察的是BST的删除一个节点的方式