Almost complete, needs a bit of code.
Finish the implementation of a binary tree, to replace the linked list implementation of the WordCounter interface from the previous lab, to make reading and searching large databases more efficient.
Start with the project Find Words Tree [url removed, login to view] in a new window then rename the folder with your last name, such as "Parker Find Words Tree". You need to complete the implementation of the WordTree class. The main program and interface are already complete. Search for "TODO" in the WordTree class, and complete the following:
(40 points) Implement the helper method nodeCount, using recursion, to return the number of nodes in the binary tree data structure.
(40 points) Implement the helper method findWord, using recursion, to search for a word in the binary tree data structure.
(20 points) Implement the countForWord method, using the findWord helper method, to return the occurrence count for a word, as required by the interface.