This is an implementation of a Java Trie. A Trie is a Datastructure, which is used to search for strings. Each node insight the Trie, represents a single character.
A Trie allows to compress the stored data, since prefixes are stored only once.
-
Notifications
You must be signed in to change notification settings - Fork 0
svoytas/Trie
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
A simple Java implementation of a Trie
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published