Trie - Data structures in Javascript

Trie is a tree data structure used for implementing autocomplete, searching words by prefix, etc. We will cover the theory behind this data structure and also implementation details. In particular we will compare it to a hash map and code it in a simplest way possible.

Contents:
0:00 Introduction to tries
3:05 Building a trie manually
8:05 Implementing nodes
11:37 Marking a word's end
13:37 Trie operations
14:48 Coding a trie

[samsonM]

Best explanation ever. Thank you so much.!

[zavenavanesyan]

Thanks a lot for your tutorial, in my humble opinion this is one of the informative video about a trie data structure for js developers.

[sandeeptottadi]

Need BFS and DFS in javascript
Please