Trie, Trie Again - A String Search Data Structure @WorldOfZeroDevelopment
Trie, Trie Again - A String Search Data Structure  @WorldOfZeroDevelopment
Uploaded April 2023 | Updated November 2026, 1 day ago
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](github.com/gmamaladze/trienet) and [Nuget](nuget.org/packages/TrieNet/). You can find more documentation and learn about it's other features here: github.com/gmamaladze/trienet

If you want to learn more about how Trie's work as a data structure you can learn more about that on Wikipedia: en.wikipedia.org/wiki/Trie

If you're interested in how to build a `Trie` from scratch we've done that in an earlier video you can find here: youtube.com/watch?v=4nmVXKu6e_Q

For more information about the Mermaid diagrams I use at the start of this video, check out [my video on Mermaid JS](youtube.com/watch?v=7_2IroEs6Is). Recently support for these diagrams was even [added to GitHub](docs.github.com/get-started/writing-on-github/working-with-advanced-formatting/creating-diagrams).

***

Join the World of Zero Discord Server: discord.gg/hU5Kq2u
Trie, Trie Again - A String Search Data StructureRing to Ripples - Ripple in Shader Graph - Part 3Creating a Stepped Gradient Shader in UnityLearning Unitys XR Input SystemUsing PowerShell to Create a Symbolic Link on WindowsBuilding Boids in Unity 3DWriting a Snow Covered ShaderUsing C#s Yield KeywordUsing Python and Argparse to Build Quick ScriptsRedesigning our C# Scripting in Unity ToolGenerating Images from SVGs with Unity and InkscapeExploring Zenject - Learning how to use Dependency Injection in Unity
World of Zero |

Trie, Trie Again - A String Search Data Structure

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER