algorithms

A trie, or prefix tree, is a multi-way tree structure useful for storing strings over an alphabet. It is very efficient and handy and can be used for various purposes like auto-complete, spell-check, dictionary search, etc. The basic idea of a Trie goes as below: We have a root node which represents an empty string.…

Read More Trie implementation in Javascript