Description
For this exercise, you are to implement BST sort and test it for correctness.
As usual, your program will prompt for the name of an input file and the read and process the data
contained in this file.
The file contains a sequence of integer values. Read them and construct a binary search tree from
the values in the order they are read. Thus; the first number read will be the root of the tree.
For this exercise, you may use dynamic data, but you should attempt to store the numbers in an
array.
You do not need to balance the tree as you construct it.
When you have read the last value into the BST, conduct an in‐order traversal to output the values in
ascending order.
Print them 10 to a line in a 5‐character wide field.
As usual, do not use classes or STL.
When you are finished, test your program using the provided text file named “Ex4.txt” and show
your code and the output to your lab tutor to receive your mark.
