Use Binary Search Tree(BST) structure with C++ to solve this problem.

Input: 11,9,4,2,7,3,17,0,5,1

Output: 4,1,0,2,3,9,5,7,11,17

Need Asap!!

But needs to satisfy the output.

11 9 4 2 73 17 0 5 1 4 1 0 2 3 9 5 7 11 17 Given a sequence of integers, determine the best ordering of the integers to insert them into a binary search tree. The best order is the one that will allow the binary search tree to have the minimum height. Hint: Sort the sequence (use the inorder traversal). The middle element is the root. Insert it into an empty tree. Now in the same way, recursively build the left subtree and then the right subtree. 11 9 4 2 73 17 0 5 1 4 1 0 2 3 9 5 7 11 17 Given a sequence of integers, determine the best ordering of the integers to insert them into a binary search tree. The best order is the one that will allow the binary search tree to have the minimum height. Hint: Sort the sequence (use the inorder traversal). The middle element is the root. Insert it into an empty tree. Now in the same way, recursively build the left subtree and then the right subtree