Patreon
Accelerant.dev

Implementing the trie data structure in Rust

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!

follow tim

Stay up to date with notifications on the latest timClicks videos, livestream community events, starter repos, and more!

Patreon

Support Tim by joining Patreon to keep these videos coming and to be part of the process! 

Join Patreon

Accelerant.dev

Education and consulting for working developers and CTOs who want to speed up their adoption of Rust—from the ground up.

learn more

© 2023, Tim McNamara. Design and development by Underscorefunk Design.

Patreon
Accelerant.dev