单选题：Given a binary search tree with its preorder traversal sequence

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

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




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


答案：B