C++

Please just do what you can, I can figure

out the rest. I just need a head start.

Thank you!

You will begin by constructing a BST of Nodes where each node has data members: int id; int value The information to be stored in the BST is given by int tree arrayl 65 3 50, 30, 20, 15, 25, 22, 29, 35, 60. 55, The entries in this array are the values of the nodes, and the index where that value is located is the id for the node. The tree can be constructed by calling the insert function in genBSTh using a loop that loops through the array. Because comparisons are required to insert nodes into the BST you will need to have an overloaded