複選題19. We create a binary search tree by considering the integers one by one, starting with the first one, 30. Which of the following are true? (A) The node for 75 is a leaf node； (B) The node for 42 is an internal node； (C)The node for 99 has only one child； (D) The height of the resulting tree is 5.