Binary Tree Search Questions

7. Consider the following binary search tree. An inorder traversal of this BST will return the data in the following order: 1, 3, 4,9,15, 24. List the order returned by a preorder traversal of the above BST 24 12 15 Insert the following data values to the above BST: 6, 45, 32, 98, 55, and 69, in this order. Draw the resulting BST. 8. 9. Next, delete 9 and 45 from the BST you drew in question 8. Draw the resulting BST. 10. List the order returned by an inorder traversal of the BST you drew in question 9