Trie is a tree-based data structure used for efficiently retrieving a key from a large set of strings. Trie differs from similar tree-based structures by having the position of it’s nodes determine their associated key. The nodes of a Trie do not hold a key themselves.

Nodes: Each node of the tree contains an array of child pointers(will be named pointers[] for all examples). The size of the array or amount of pointers is determined by the unique number of characters present in the dataset you want to store (lowercase only English — 26 pointers). …

Christopher Alvear

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store