Java Trie
Introduction
A Trie (pronounce “try”) is a tree-based data structure in order to support fast pattern matching. The “trie” comes from the word “retrieval”.
This structure is particularly useful for any application requiring prefix based (read “starts with”) pattern matching.A good example is any kind of application where we let the user type and quickly come up with a list of words starting with what the user typed in. Read the rest of this entry »