Do the code in c++. Please kindly share the whole code and also the final output.

Generate the Driver file (main.cpp) where you perform the following tasks: Input Values Expected Output 14 92 73 11 . Operation to Be Tested and Description of Action Implement the BST structure Print if the tree is empty or not Insert ten items Print if the tree is empty or not Print the length of the tree Retrieve 9 and print whether found or not Retrieve 13 and print whether found or not Print the elements in the tree (inorder) Print the elements in the tree (preorder) Print the elements in the tree (postorder) Make the tree empty 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 Tree is empty 17 0 5 1 Tree is not empty 10 Item is found Item is not found 0 1 2 3 4 5 7 9 11 17 4 20 1 3 975 11 17 1 0 3 2 5 7 17 11 9 4 11 9 42 73 17 0 5 4 1 0 2 3 95 7 11 17 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