Tries/Prefix Trees

What is a Trie?

Tries are trees, that are designed to efficiently retrieve all keys with a common prefix. This is useful in cases of auto-completion like: browser history, code completion, spelling suggestions, and more...

Properties of a Trie

Some important Trie properties are:

• Each Trie has an empty root node, with links (or references) to other nodes
• Trie data structure can contain any number of characters including alphabets, numbers, and special characters
• Each path from the root to any node represents a word or string

Example Trie

Additional information

For more information on Tries visit this website.