The third programming project involves writing a program that performs a sort by using a binary search tree.
computer science
Description
The third programming project involves writing a program that performs a sort by using a binary
search tree. The program should be able to sort lists of integers or lists of fractions in either
ascending or descending order. One set of radio buttons should be used to determine whether the
lists contain integers or fractions and a second set should be used to specify the sort order. The
main class should create the GUI shown below:
The GUI must be generated by code that you write. You may not use a drag-and-drop GUI
generator.
Pressing the Perform Sort button should cause all the numbers in the original list to be added to a
binary search tree. Then an inorder traversal of the tree should be performed to generate the list
in sorted order and that list should then be displayed in the sorted list text field.
In addition to the main class that defines the GUI, you should have a generic class for the binary
search tree. That class needs a method to initialize the tree, one that allows a new value to be
inserted in the tree and one that performs an inorder tree traversal that generates and returns a
string that contains the tree elements in sorted order. The insert method does not need to
rebalance the tree if it becomes unbalanced. It should allow duplicate entries and it must be
written using recursion. It is not necessary to have a method to delete a node from the tree nor
one to check whether a particular value is in the tree.
