Tries and Suffix

Choose difficulty:

Beginner

Intermediate

Advanced

1. There is a Trie with the words [CAT, CAGGLE, COG, CANOPY, CATIS]. How many nodes does this Trie have, including the start and end nodes?

a: 5 Nodes Explanation

Explanation

b: 16 Nodes Explanation

Explanation

c: 21 Nodes Explanation

Explanation

d: 22 Nodes Explanation

Explanation

2. What is the memory complexity of a Trie with no path compression?

a: O(Number of Words) Explanation

Explanation

b: O(Length of the Longest Word) Explanation

Explanation

c: O(Sum of Lengths of Words) Explanation

Explanation

d: O(Total Number of Unique Characters) Explanation

Explanation

3. In the Trie with words [HELLO, HELSINKI, HILBERT], we are adding the word HILLS. How many nodes will be created and added in this process?

a: 0 Nodes Explanation

Explanation

b: 5 Nodes Explanation

Explanation

c: 2 Nodes Explanation

Explanation

d: 3 Nodes Explanation

Explanation

e: 1 Node Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

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