Tries - n-ary Prefix Tree

Trie - pronounced as try, derived from retrieval is a data-structure based on n-ary tree and is a specialized form of prefix trees. In this article, we will first see what is a trie and then we will discuss about the dictionary appl