Consider a binary search tree that results from successively inserting keys 2, 8, 9, 1, 5, 7, 6, 3, 4 into an initially empty tree. Which of the following statements are true?