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.
If you want to learn more about how Trie’s work as a data structure you can learn more about that on Wikipedia: https://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: https://www.youtube.com/watch?v=4nmVXKu6e_Q
Join the World of Zero Discord Server: https://discord.gg/hU5Kq2u