Westonci.ca offers quick and accurate answers to your questions. Join our community and get the insights you need today. Ask your questions and receive accurate answers from professionals with extensive experience in various fields on our platform. Our platform provides a seamless experience for finding reliable answers from a network of experienced professionals.

1. 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.
2. Present the steps to insert a vertex with key 8 into the tree obtained in question 1.
3. Is the tree obtained in question 2 balanced or not