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
On this page of the site you can watch the video online Trie - Data structures in Javascript with a duration of hours minute second in good quality, which was uploaded by the user Questionable Coding 23 July 2021, share the link with friends and acquaintances, this video has already been watched 6,772 times on youtube and it was liked by 166 viewers. Enjoy your viewing!
