1. Use the binary search tree to answer the following questions: (a) What is the pre-order traversal of this tree? (b) What is the in-order traversal of this tree? (c) What is the post-order traversal of this tree? 2. What is the maximum height of a binary search tree that contains n items? Why? 3. What is the minimum height of a binary search tree that contains n items? Why? 4. Why is it important for a binary search tree to remain balanced? 5. Write an implementation for finding the minimum element in a binary search tree, print all the numbers that divisible by 3. You may write either a recursive or iterative implementation. A D H K L M U V T W