## Trie data structure

A trie is a tree like data structure. Trie is also called as prefix tree. In this article, we going to see three main operations of trie data structure. They are: Insert Delete Search TrieNode class TrieNode { int terminating; TrieNode[] trieNodes = new TrieNode[26]; public TrieNode next(final char c) { return trieNodes[c – ‘a’]; …