实现Trie树的搜索和前缀查询功能 #4
Open
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This pull request enhances the functionality of the
Trieclass by adding a search method to check for the existence of words and implementing logic to retrieve all words with a given prefix. These changes improve the usability and feature set of theTrieimplementation.New functionality:
Added a
search(String word)method to check if a word exists in theTrie. This method traverses theTrieand returnstrueif the word is found and marked as an end of a word.Implemented the
getAllWordsWithPrefix(TrieNode node, String prefix)method to retrieve all words in theTriethat start with a given prefix. This method recursively collects words by traversing the children of the specified node.