I need to write a maximum function so that it finds that longest word in the Ternary Search Tree and prints it.
This is what I have done so far. I have words in the t
