A Trie (also called prefix tree) is a data structure which allow fast searching of strings in O(k) time where k is the length of string. Used mainly as dictionary, providing auto-completion feature etc. Read more here http://en.wikipedia.org/wiki/Trie
Good demo
praskuma 4 months ago
nice implementation, thanks for putting this up !!!
javacoder1986 8 months ago