Build a Binary Search Tree with the given input order. You must show step by step process of inserting the inputs including both recursive calls and tree diagrams for each step. [ refer to the InsertItem function of Lecture10 slides to get an idea of doing this.] N.B: Unique Input orders for each student to build the tree are given on a separate file. Write down the input order on your answer script before answering the question. You must use the assigned input order. Do not change the order.

Unique Input orders for each student to build the tree are given on a separate file. Write down the input order on your answer script before answering the question

3,5,1,2,8,9,4,6,7

2.#answer only qs 2 bases on QA 1

Write down the inorder, preorder, and post-order traversal of the tree you made in Question 1