Trie Data Structure Tutorial - Introduction to the Trie Data Structure
Learn more advanced front-end and full-stack development at: https://www.fullstackacademy.com
In computer science, a Trie is a type of search tree used to represent the retrieval of data (thus the name Trie). It’s an ordered data structure that is based on the prefix of a string. In this Trie Data Structure Tutorial, we introduce this oft-overlooked, but truly impressive data structure. We begin with an explanation of the standard trie, demonstrate an implementation of it in JavaScript, and finally, dive into the Burstsort algorithm to illustrate how tries are used to build one of the fasted sorting algorithms for strings.
Watch this video to learn:
- What is a Trie Data Structure
- How does a standard Trie work
- How to implement Tries in JavaScript