Tries and Suffix

1. Upto how many children can each node in the trie have?

a: 26 (As many letters as in the Alphabet) b: 27 (As many letters as in the Alphabet + 1) c: Depends on the size of the longest word d: Depends on the size of the shortest word

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

a: The number of letters in the alphabet b: The number of insert operations performed. c: The number of search operations performed. d: The number of unique words entered into the Trie

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

a: The Word 'ANT' is present in the Trie and has been found. b: The Word 'ANT' might be present somewhere else in the Trie but has not been found. c: The Word 'ANT' is not present, but other words starting with the letters 'ANT...' might be. d: The word ANT is not present, and is not the prefix or suffix of any other string.

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

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