Starting from the structures in C develop a Trie tree to store a dictionary file with 350000 words. And evaluate the performance of insertion and search. Extend this algorithm to a more optimized version of Trie Tree, Radix Tree.
-
Notifications
You must be signed in to change notification settings - Fork 0
theekshanadis/Trie-Implementation-
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
Trie tree implementation using C .
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published