boolean function ( String arg0 ) { return false ; }
insert a word into the trie . for the basic part of the assignment part 2 , you should convert the string to all lower case before you insert it . this method adds a word by creating and linking the necessary trie nodes into the trie , as described outlined in the videos for this week . it should appropriately use existing nodes in the trie , only creating new nodes when necessary . e.g. . if the word `` no '' is already in the trie , then adding the word `` now '' would add only one additional node for the ` w ' . concode_field_sep int size concode_elem_sep TrieNode root concode_field_sep int size concode_elem_sep List<String> predictCompletions concode_elem_sep boolean isWord concode_elem_sep void printNode concode_elem_sep void printTree