Java Program. (Data Structures and algorithm)

This assignment is about tree sort. In this assignment, you will implement an algorithm that uses a binary search tree (BST) in order to sort an array of objects. The sort that involves is tree sort which is produced by using in-order traversal.

Test this tree sort by using the following sample output:

Before Sorting: (23, 45, 12, 67, 78, 34, 35, 25)

After Sorting: (12, 23, 25, 34, 35, 45, 67, 78)

You will be graded on:

1. The neatness of code and use of proper indentation of 4 spaces, 8 spaces, 12 spaces, etc.
2. Commenting of code - including Class comment, @author, @version tags, and code comments. All comments are concise.
3. Good use of constant and variable names - they should be descriptive names and not individual characters or abbreviations and all the variables should have names that show their purposes.
4. Good Structure