Print Tree components
<p>I am new to java and  I want to create a very <em>simple</em> "word completion " program. I will be reading in a dictionary file and recursively adding the words into a Node array (size 26). I believe I have managed to do this successfully but I am not sure how to go through and print the matches. For the sake of testing, I am simply inserting 2 words at the moment by calling the function. Once everything is working, I will add the method to read the file in and remove junk from the word. </p>

<p>For example: If the words "test" and "tester" are inside the tree and the user enters "tes", it should display "test" and "tester". </p>

<p>If somebody could please tell me how to go through and print the matches (if any), I would really appreciate it. Full code is below.</p>

<p>Thank you</p>
