Updated on Mon Dec-18:  Please see step 1b.

1.  Add 1 more function to the code from Assignment 22 -- namely, treeSort -- and modify the main() to use this effectively.  For this, you may wish to use the treeSort code we developed in class (available here in treeSort.zip).  However, you should move the sorting code out of main() and into the Tree class, so that there is a function:  static void Tree::TreeSort(intVectorByReference v)

1b. Also:  if you do use the in-class code, please modify ExtractSortedVector() so that it is a void and the index is by-reference (this makes for cleaner code).

2.  Plot a graph of this new sorting function, mapping execution time against size of the vector.

3.  Prepare for a quiz tomorrow on treeSort.  For that quiz, starting from a blank compiler, you will have to construct a Tree class and define and use the TreeSort() function.

Good luck.

DK