public TrieNode find(String word){
  return (word.length() < 1 ? null : find(word,root,0));
}

public TrieNode find ( String word ) { return ( word . length ( ) < 1 ? null : find ( word , root , 0 ) ) ; }
look up the given word in this trie . if a match is found , a trienode is returned . this node is the root of a subtree containing all the matches to the query .
