Tries and Suffix

Choose difficulty:

Beginner

Intermediate

Advanced

1. Up to how many children can each node in a trie have?

a: 26 (As many letters as in the alphabet) Explanation

Explanation

b: 27 (As many letters as in the alphabet + 1) Explanation

Explanation

c: Depends on the size of the longest word Explanation

Explanation

d: Depends on the size of the shortest word Explanation

Explanation

2. The number of '$' characters in a trie equals:

a: The number of letters in the alphabet Explanation

Explanation

b: The number of insert operations performed. Explanation

Explanation

c: The number of search operations performed. Explanation

Explanation

d: The number of unique words entered into the trie Explanation

Explanation

3. If the letters '^', 'A', 'N', 'T' are encountered consecutively when searching, but there is no '$' attached directly to the letter 'T', which of the following are true?

a: The word 'ANT' is present in the trie and has been found. Explanation

Explanation

b: The word 'ANT' might be present somewhere else in the trie but has not been found. Explanation

Explanation

c: The word 'ANT' is not present, but other words starting with the letters 'ANT...' might be. Explanation

Explanation

d: The word 'ANT' is not present, and is not the prefix or suffix of any other string. Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)