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:

Example Trie

Trie Data Structure

Additional information

For more information on Tries visit this website.