Trie Quiz Online Practice Test

1. What is another name for a Trie?

2. Which traversal method of a trie produces lexicographically sorted strings?

3. Which data structure is most efficient for word searches in dictionaries?

4. Which specialized trie is optimized for quick full-text searches?

5. The code snippet below inserts a string into a trie. Identify the missing line.

private void insert(String str) {
TrieNode node = root;
for (int i = 0; i < length; i++) {
int index = key.charAt(i) - 'a';
if (node.children[index] == null)
node.children[index] = new TrieNode();
________________________
}
node.isEndOfWord = true;
}

6. Which statement about tries is incorrect?

7. For efficiently searching a contact in a phone directory, which data structure is most suitable?

8. What is the maximum depth of a trie containing n strings with each string having a maximum length of  m?

9. Which statement accurately describes a trie?

10. Auto-complete and spell checkers can be efficiently implemented using a trie.