Menu

• Home
• Data Structures
• Mathematics
• Language
• Writing

My favorite data structure is a Trie.

In this example, the underline words have been inserted into the Trie.
* Ignoring case.

Hello World. My name is Shia, but my friends call me ShY. I work at the DoIT Help Desk. I put my heart into my job and I love to make people smile. I believe anyone can code, write or do math. Let's get our smart on.

A Trie essentially works by taking single characters of inputs, and storing them into individual nodes.

• The nodes are stored in order. With the first letter as the head.
• When a new word is being stored, the Trie begins by determining if there already is a node representation of the first character for the new word.
  • if there is, then the Trie enters that node tree and moves to the second character of the new word.
  • This sub process runs until there is a unique character
• Once a unique character is found, the Trie creates a new child node representing that new unique node.