Trie Search Operation in DSA C# - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is a Trie data structure?

A Trie is a tree-like data structure used to store a dynamic set of strings where keys are usually strings. Each node represents a character, and paths down the tree represent words.

beginner

What does the search operation in a Trie do?

The search operation checks if a given word exists in the Trie by traversing nodes corresponding to each character in the word. If all characters are found and the last node marks the end of a word, the search returns true.

beginner

In Trie search, what does it mean if a character node is missing during traversal?

If a character node is missing, it means the word does not exist in the Trie, so the search returns false immediately.

intermediate

Why do we check the 'end of word' flag in Trie search?

Because some words can be prefixes of others, the 'end of word' flag confirms that the path corresponds to a complete word stored in the Trie, not just a prefix.

intermediate

What is the time complexity of searching a word in a Trie?

The time complexity is O(m), where m is the length of the word being searched, because we check each character once.

What does the Trie search operation return if the word is found?

A True

B False

C Null

D The word's length

The search returns true if the word exists in the Trie.

What happens if a character node is missing during Trie search?

A Insert the character

B Continue searching

C Return false immediately

D Return true

If a character node is missing, the word is not in the Trie, so search returns false.

Why do we check the 'end of word' flag in Trie search?

A To count characters

B To confirm the word is complete

C To find prefixes

D To delete the word

The flag confirms the path corresponds to a complete stored word, not just a prefix.

What is the time complexity of searching a word of length m in a Trie?

A O(m)

B O(log m)

C O(1)

D O(m^2)

Search time depends linearly on the word length m.

Which data structure is best suited for fast prefix searches?

A Array

B Linked List

C Stack

D Trie

Trie is designed for efficient prefix-based searches.

Explain how the search operation works in a Trie data structure.

Think about walking down the tree following each letter.

Why is the 'end of word' flag important in Trie search?

Consider words that share the same starting letters.

Practice

1. What does the Search operation in a Trie data structure do?

easy

A. Checks if a given word exists in the Trie

B. Inserts a new word into the Trie

C. Deletes a word from the Trie

D. Counts the total words stored in the Trie

Solution

1. Step 1: Understand the purpose of Search in Trie

   The Search operation is designed to check if a specific word is present in the Trie data structure.

2. Step 2: Differentiate from other operations

   Insertion adds words, deletion removes words, and counting totals words. Search only checks existence.

3. Final Answer:

   Checks if a given word exists in the Trie -> Option A

4. Quick Check:

   Search = Check word presence [OK]

Hint: Search checks presence, not insertion or deletion [OK]

Common Mistakes:

• Confusing search with insert operation
• Thinking search deletes words
• Assuming search counts words

2. Which of the following is the correct C# method signature for a Trie search operation that returns a boolean?

easy

A. public void Search(string word)

B. public bool Search(string word)

C. public int Search(string word)

D. public string Search(string word)

Solution

1. Step 1: Identify return type for search

   Search should return true or false indicating if the word exists, so return type must be bool.

2. Step 2: Check method signature correctness

   Method takes a string parameter for the word and returns bool, matching "public bool Search(string word)".

3. Final Answer:

   public bool Search(string word) -> Option B

4. Quick Check:

   Search returns bool for word presence [OK]

Hint: Search returns true/false, so return type is bool [OK]

Common Mistakes:

• Using void return type for search
• Returning int or string instead of bool
• Incorrect method parameter types

3. Given the following Trie search code snippet, what will be the output when searching for the word "cat" after inserting "car" and "cat"?

Trie trie = new Trie();
trie.Insert("car");
trie.Insert("cat");
Console.WriteLine(trie.Search("cat"));
Console.WriteLine(trie.Search("cap"));

medium

A. False
True

B. True
True

C. True
False

D. False
False

Solution

1. Step 1: Analyze inserted words

   Words "car" and "cat" are inserted, so both exist in the Trie.

2. Step 2: Check search results for "cat" and "cap"

   "cat" exists, so search returns true; "cap" was not inserted, so search returns false.

3. Final Answer:

   True False -> Option C

4. Quick Check:

   Search("cat")=True, Search("cap")=False [OK]

Hint: Inserted words return true; others return false [OK]

Common Mistakes:

• Assuming "cap" exists after inserting "car" and "cat"
• Mixing output order
• Confusing true/false outputs

4. Identify the bug in this Trie search method that causes it to always return false:

public bool Search(string word) {
    TrieNode node = root;
    foreach (char c in word) {
        if (!node.Children.ContainsKey(c))
            return false;
        node = node.Children[c];
    }
    return false;
}

medium

A. The method should return true immediately after first character check

B. It should return false if node.Children contains the character

C. The foreach loop should iterate over node.Children keys

D. It should return true after checking all characters if node marks end of word

Solution

1. Step 1: Understand the search logic

   The method checks each character in the word exists in the Trie nodes.

2. Step 2: Identify the missing return condition

   After the loop, it always returns false instead of checking if the current node marks the end of a valid word.

3. Final Answer:

   It should return true after checking all characters if node marks end of word -> Option D

4. Quick Check:

   Return true if end of word reached [OK]

Hint: Return true only if end of word node reached [OK]

Common Mistakes:

• Returning false unconditionally after loop
• Not checking end of word flag
• Returning true too early

5. You want to modify a Trie search operation to support prefix search (checking if any word starts with a given prefix). Which change is correct?

hard

A. Return true as soon as all prefix characters are found, without checking end of word

B. Return true only if the prefix is also a complete word in the Trie

C. Return false if any character in prefix is found

D. Return true only if prefix length equals word length

Solution

1. Step 1: Understand prefix search goal

   Prefix search should confirm if the Trie contains any word starting with the given prefix.

2. Step 2: Adjust search logic for prefix

   Return true immediately after all prefix characters are found, no need to check if prefix is a complete word.

3. Final Answer:

   Return true as soon as all prefix characters are found, without checking end of word -> Option A

4. Quick Check:

   Prefix found = true without full word check [OK]

Hint: Prefix search returns true once prefix path exists [OK]

Common Mistakes:

• Checking end of word for prefix search
• Returning false if prefix is not a full word
• Confusing prefix search with full word search