-
Notifications
You must be signed in to change notification settings - Fork 0
Trie data structure implemented in python. A class TrieNode is created which has methods add, to add words to the trie and find to find words in a trie. Find returns a boolean to indicate if the word was found in its entirety or not, the index of the last character found in the word, the unique value given to the trie node and the last trie node…
nxtexe/Trie-Data-Structure
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
About
Trie data structure implemented in python. A class TrieNode is created which has methods add, to add words to the trie and find to find words in a trie. Find returns a boolean to indicate if the word was found in its entirety or not, the index of the last character found in the word, the unique value given to the trie node and the last trie node…
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published