Rust Programming Exercises: Autocomplete with Tries

In this video we implement a Trie data structure to efficiently store words in a dictionary and phrases to be used for fuzzy search and autocomplete search results. We make use of the Default trait to help us generate a default node, a recursive Node in the Trie will store a vector of children, and we store the count for the frequency of the words along the tree. We discuss the inversion of the Prefix Trie as a Suffix Tree in order to find the common suffixes, the use of bitwise binary trees to store the bits of each valid child in an alphabet. Along with the search and exists functions, we implement a Display trait to help format the output of the Trie with a level order traversal similar to the tree traversal algorithms in previous videos.

↠ References:

Cheers! 🍻

🦀 #rust #rustlang #rustprogramming #exercises #programming

[beto]

I was just starting to look into this and youtube recommendations did its magic

[oyewodayo]

Hi Thomas. Be my Rust mentor. I love your experimental and practical mode of programming.