A Common-Sense Guide to Data Structures and Algorithms in JavaScript, Volume 1

Exercises

The following exercises provide you with the opportunity to practice with tries. The solutions to these exercises are found in the section ​Chapter 17​.

1. List all the words stored in the following trie:

   

2. Draw a trie that stores the following words: “get”, “go”, “got”, “gotten”, “hall”, “ham”, “hammer”, “hill”, and “zebra”.

3. Write a function that traverses each node of a trie and prints each key, including all "*" keys.

4. Write an autocorrect function that attempts to replace a user’s typo with a correct word. The function should accept a string that represents text a user typed in. If the user’s string is not in the trie, the function should ...