Trie is a data structure which is used for storage or querying in dictionaries or documents. It is basically a tree with a 26 children that corresponds to every character or letter in the English language. In this exercise most of the operations and the operator overloads for Trie is shown in the cpp and header files.
-
Notifications
You must be signed in to change notification settings - Fork 0
Trie is a data structure which is used for storage or querying in dictionaries or documents. It is basically a tree with a 26 children that corresponds to every character or letter in the English language. In this exercise most of the operations for Trie is shown in the cpp and header files.
akipekoren/Trie
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
About
Trie is a data structure which is used for storage or querying in dictionaries or documents. It is basically a tree with a 26 children that corresponds to every character or letter in the English language. In this exercise most of the operations for Trie is shown in the cpp and header files.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published