-
Notifications
You must be signed in to change notification settings - Fork 0
Recursively implemented a Trie Data Structure to support various word manipulations including Autocomplete. A trie is a 26-ary tree where the root node represents an empty string “” and if the kth (k going from 0 to 25) subtree is not a null subtree, it represents a string that is the concatenation of the characters represented by the parent and…
Sparsh2234/Trie-Data-Structure-Program
ErrorLooks like something went wrong!
About
Recursively implemented a Trie Data Structure to support various word manipulations including Autocomplete. A trie is a 26-ary tree where the root node represents an empty string “” and if the kth (k going from 0 to 25) subtree is not a null subtree, it represents a string that is the concatenation of the characters represented by the parent and…
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published