Skip to main content


Introduction to the Trie Data Structure

In this short video, Edmond Kotwick talks about an oft-overlooked, but truly impressive data structure—the trie. Edmond begins with an explanation of the standard trie and then demonstrates an implementation of it in JavaScript. Finally, Edmond dives into the burstsort algorithm to illustrate how tries are used to build one of the fasted sorting algorithms for strings.

Project Members: Edmond Kotwick

Find the program that fits your life.

Learn about our coding, cybersecurity, and data analytics bootcamps offered on full-time and part-time schedules.