Help writing a Dictionary Java Program

Program Requirements

-Read a text file.

-Store the words from the text file into a binary search tree.

-To make the problem easier, you may assume that each line in the file contains only one word.

-Continue prompting the user for names of text files, reading from text files and adding words to the binary search tree until the user exits the program.

-When the program closes, the binary search tree is discarded and when the program starts again, the tree starts in an empty state.

-Upon request of the user, display the words stored in the binary search tree in alphabetical order along with the number of times each word appeared in the text file.

-In addition, display the total number of words in the tree (count includes duplicates) and the total number of unique words in the tree

(not including duplicates)

-The words should be case insensitive. That is, "Dog" is equivalent to "doG". If both "Dog" and

"doG" appear in the text file, your program would report that there are two occurrences of the

word "dog".

-You must implement the binary search tree data structure and may not use the collection data structures provided in Java libraries

-Use of a graphical user interface for input is required.

-Do not use pop ups. You may display your results in the console window. However, the output must be clearly labeled.

-The use of the widget which allows a user to browse and select a file is recommended.

-Do not hard code the name of text file (although you may wish to do this when you test

early versions of your program

-Do not hard code any pathnames into your program