Implementing the trie data structure in Rust
Channel: timClicks
Date: 2023-03-31

In this fun tutorial, Tim McNamara, the author of Rust in Action, demonstrates how to implement a trie data structure in Rust. If you're looking to improve your Rust skills and learn more about data structures, this video is a must-watch! 🚀

In this video, you'll learn:

🌳 What a trie is and why it's a valuable data structure for tasks such as search optimization and word suggestion
🔧 A naive implementation of a trie using HashMap from Rust's standard library, providing a solid foundation for understanding the core concepts
🚀 A more sophisticated implementation utilizing a bespoke hash function with the help of the fxhash crate, enhancing performance and efficiency

Join Tim  as he takes you on a journey through the fascinating world of data structures in Rust, filled with live-coding examples and in-depth explanations. This video is a recording of a live stream - don't forget to like, share, and subscribe to stay updated on the latest Rust programming content and future streams! 📚💻

References from the video

Code  https://dev.to/timclicks/two-trie-implementations-in-rust-ones-super-fast-2f3m
Stdlib HashMap https://doc.rust-lang.org/std/collections/struct.HashMap.html
FxHash https://crates.io/crates/fxhash

Connect with Tim

Mastodon: https://mastodon.nz/@timClicks 
Twitter: https://twitter.com/timClicks
GitHub: https://twitter.com/timClicks
DEV https://dev.to/timclicks/