Detailed Expanation on how this is done please I understand what is going on but I want to make sure that I get this concept correct.

the two insert functions are mytree.insert(values[ i ]); and mytree.insert([ 7 - i ] );

2.1) (15pt) Assume a BST is created using the code below. Write the output of performing an inorder traversal on mytree. 2 int values- K60, 60, 45, 82, 47 35, 20, 30); BST mytree; mytree.insert (40); for (int i-0; i