13. The pre-order traversal of a Binary Search Tree (BST) is 31, 27, 21, 12, 25, 30, 29, 38, 33, 41 and its in-order traversal is 12, 21, 25, 27, 29, 30, 31, 33, 38, 41. When the element to be deleted is in a non-leaf node that has two children, the element is replaced by the largest element in its left subtree. When a key value 36 is inserted into the binary search tree, which of the following statements is CORRECT
(A) The key value 38 is the parent of key value 36.
(B) The key value 30 has two children.
(C) The key value 27 is the parent of key value 25.
(D) The BST has three leaf nodes.
(E) If we delete the key value 30, then key value 29 will inherit it.