awreese

//Dictionary implemented using a Trie Tree.
public class Dictionary {
	private HashMap<Character,Node> roots = new HashMap<Character,Node>();
	
	/**
	 * Search through the dictionary for a word.
	 * @param string The word to search for.
	 * @return Whether or not the word exists in the dictionary.
	 */
	public boolean search(String string) {