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

Given a binary search tree with its postorder traversal sequence { 5, 7, 12, 10, 20, 19, 31, 21, 15 }. If 15 is deleted from the tree, which one of the following statements is FALSE?
@[A](3)

A. One possible preprder traversal sequence of the resulting tree may be { 20, 10, 7, 5, 12, 21, 19, 31 }
B. One possible preprder traversal sequence of the resulting tree may be { 12, 10, 7, 5, 21, 19, 20, 31 }

C. One possible preprder traversal sequence of the resulting tree may be { 19, 10, 7, 5, 12, 21, 20, 31 }

D. It is possible that the resulting tree may have 3 leaves




A.One possible preprder traversal sequence of the resulting tree may be { 20, 10, 7, 5, 12, 21, 19, 31 }
B.One possible preprder traversal sequence of the resulting tree may be { 12, 10, 7, 5, 21, 19, 20, 31 }

C.One possible preprder traversal sequence of the resulting tree may be { 19, 10, 7, 5, 12, 21, 20, 31 }

D.It is possible that the resulting tree may have 3 leaves



答案：A