Recursively implemented a Trie Data Structure to support various manipulations on sentences. 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 the kth letter of the alphabet (where ‘a’ is the 0th letter). Programmed DFS (Depth First Search) to support alphabetical word prints and autocomplete.
-
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
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
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