A data structure to load word list effciently on memory
Assuming we have these words in our word list:
- All
- Allo
- Allocation
- Book
- Batch
- Bat
- Like
- Linux
- Zoo
Out data structure would be like this:
pouyan9675/Dictionary-Linked-List
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 | |
|---|---|---|---|---|
Repository files navigation
About
Implementation of a Trie
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published