Java Assignment

Using binary tree code I already have written, you will open and read a text file, then display a list of all anagrams that appear in the file. The program works by reading each word from the input file and process into a String and create a second String with an alphabetized version of this word. Both versions are then put into one node which is inserted into a binary search tree using the alphabetized version for comparisons during the insertion.