question: public TrieNode find ( String word ) { return ( word . length ( ) < 1 ? null : find ( word , root , 0 ) ) ; }
target:  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.