This page looks best with JavaScript enabled

Trie, Trie Again - A String Search Data Structure

 ·   ·  ☕ 1 min read

Trie’s are a sort of prefix search tree that uses prefix substrings to efficiently search and complete a word search. This allows you to search for a string matching a prefix of a large number of strings without having to individually test against every string.

Trie.Net is available on GitHub and Nuget. You can find more documentation and learn about it’s other features here:

If you want to learn more about how Trie’s work as a data structure you can learn more about that on Wikipedia:

If you’re interested in how to build a Trie from scratch we’ve done that in an earlier video you can find here:

For more information about the Mermaid diagrams I use at the start of this video, check out my video on Mermaid JS. Recently support for these diagrams was even added to GitHub.

Join the World of Zero Discord Server:

Sam Wronski
Sam Wronski
Maker of things and professional software engineer. Lets make something awesome together!