7. Insert 10: a. Create a new node with value 10. b. Starting at the root node (2), compare the value of the new node (10) to the value of the C. current node (2). Since 10 is greater than 2, move to the right child (5). d. Since 10 is greater than 5, move to the right child (9). e. Since 10 is less than 9, move to the left child. f. Insert 10 as the left child of 9.