Insertion in a Trie
This lesson defines all the cases needed for inserting a word into a trie, along with the JavaScript implementation.
We'll cover the following...
Word Insertion #
The insertion process is fairly simple. For each character in the key, we check if it exists at the position we desire. If the character is not present, then we insert the corresponding trie node at the correct index in children. While inserting the last node, we also set the value of isEndWord to true.
There are three primary cases we need to consider during insertion. Let’s discuss them now.