public SuffixTrieNode < I > add ( I symbol , SuffixTrieNode < I > parent ) { SuffixTrieNode < I > n = new SuffixTrieNode <> ( symbol , parent ) ; if ( nodes != null ) { nodes . add ( n ) ; } return n ; }
Adds a word to the trie .