26-ary tree for spell checker in JAVA
You are asked to write some functionalities for a spelling checkerinside Tree.java that has at least the following methods:
/*Adds a word to a spelling checker’s collection of correctly spelled words*/ void add(String word) /*Returns true if the given word is spelled correctly*/ boolean check(String word) /*Returns back all words in the tree in alphabetical order*/ public String getDictionaryInAlphabeticalOrder()
Store the collection of correctly spelled words in a 26-arytree. The number 26 indicates that each node in the tree has atmost26 children (i.e. one each for the english alphabet).
OR
OR