1. You are given the following list: [71,65,62,60,58,55,48,42,41,40,38,37,29,25,22] to be used in the BST constructor.

a. Draw the resulting tree produced by the constructor.

b. How balanced is the tree.

c. Could you represent this particular BST with another data structure? Base your answer in the BST you have drawn in item a.

d. What is the time complexity of searching 22 in this BST?

e. What happens if you create a new tree by traversing the original BST inorder?

Please answer using a step by step method.