Insert the following keys [6, 4, 9, 2, 3, 5, 7, 1] one by one into an empty binary search tree. Draw a binary search tree after inserting all the above keys.
Present the steps to insert a vertex with key 8 into the tree obtained in question 1.
Is the tree obtained in question 2 balanced or not