write a method called Comparisons that will return the number
of comparisons to find an element in the tree. The main program
calls this method for each element, adding the comparisons each
time in order to count the total number of comparisons. The program
then outputs the total number of comparisons and the average
number. You may use the program BuildTreeWIthMethod to build your
tree. Then, after you have made the call to inOrder(root), add the
following code:
int totalComparisons=0;...