Why Word Search in Trie in DSA C++?

The Big Idea

What if you could find any word instantly without flipping through pages?

The Scenario

Imagine you have a huge dictionary of words written on paper. You want to find if a word exists, but you have to flip through every page and every word one by one.

The Problem

This manual search is very slow and tiring. It wastes time flipping pages and checking words, and you might miss the word or make mistakes.

The Solution

A Trie is like a smart tree that organizes words by their letters. It lets you quickly jump to the right place for each letter, so you find words fast without checking everything.

Before vs After

✗ Before

bool searchWord(vector<string> dictionary, string word) {
  for (string w : dictionary) {
    if (w == word) return true;
  }
  return false;
}

✓ After

bool searchWord(TrieNode* root, string word) {
  TrieNode* current = root;
  for (char c : word) {
    if (!current->children[c - 'a']) return false;
    current = current->children[c - 'a'];
  }
  return current->isEndOfWord;
}

What It Enables

It enables lightning-fast word searches even in huge word lists, making text processing and autocomplete smooth and efficient.

Real Life Example

When you type on your phone keyboard, the system quickly checks possible words to suggest completions or corrections using a Trie behind the scenes.

Key Takeaways

Manual word search is slow and error-prone.

Trie organizes words by letters for fast lookup.

Using Trie makes word search efficient and scalable.

Practice

1. What is the main purpose of using a Trie data structure in word search problems?

easy

A. To store words in a linked list

B. To sort words alphabetically

C. To efficiently store and search words by their prefixes

D. To perform arithmetic operations on words

Solution

1. Step 1: Understand Trie structure

   A Trie stores characters of words in a tree where each node represents a character, allowing prefix sharing.

2. Step 2: Identify Trie use in word search

   Because words share prefixes, Trie allows fast prefix-based search, making word search efficient.

3. Final Answer:

   To efficiently store and search words by their prefixes -> Option C

4. Quick Check:

   Trie = prefix search [OK]

Hint: Trie is best for prefix-based word search [OK]

Common Mistakes:

• Confusing Trie with sorting structures
• Thinking Trie stores words linearly
• Assuming Trie is for arithmetic

2. Which of the following is the correct way to declare a Trie node class in C++ for word search?

easy

A. class TrieNode { public: TrieNode* children[26]; bool isEndOfWord; };

B. class TrieNode { int data; TrieNode* next; };

C. struct TrieNode { vector<int> children; bool end; };

D. class TrieNode { char letter; TrieNode* left; TrieNode* right; };

Solution

1. Step 1: Check Trie node structure for word search

   Trie nodes typically have an array of pointers for 26 letters and a boolean to mark word end.

2. Step 2: Match with options

   class TrieNode { public: TrieNode* children[26]; bool isEndOfWord; }; matches this structure exactly with children array and isEndOfWord flag.

3. Final Answer:

   class TrieNode { public: TrieNode* children[26]; bool isEndOfWord; }; -> Option A

4. Quick Check:

   Trie node = children array + end flag [OK]

Hint: Trie nodes have 26 children pointers and end flag [OK]

Common Mistakes:

• Using linked list pointers instead of array
• Using vector<int> instead of pointers
• Confusing binary tree node with Trie node

3. What will be the output of the following C++ code snippet that inserts words into a Trie and searches for "cat"?

class TrieNode {
public:
    TrieNode* children[26] = {nullptr};
    bool isEndOfWord = false;
};

class Trie {
public:
    TrieNode* root;
    Trie() { root = new TrieNode(); }
    void insert(string word) {
        TrieNode* node = root;
        for (char c : word) {
            int index = c - 'a';
            if (!node->children[index])
                node->children[index] = new TrieNode();
            node = node->children[index];
        }
        node->isEndOfWord = true;
    }
    bool search(string word) {
        TrieNode* node = root;
        for (char c : word) {
            int index = c - 'a';
            if (!node->children[index])
                return false;
            node = node->children[index];
        }
        return node->isEndOfWord;
    }
};

int main() {
    Trie trie;
    trie.insert("cat");
    trie.insert("car");
    trie.insert("dog");
    cout << (trie.search("cat") ? "Found" : "Not Found") << endl;
    return 0;
}

medium

A. Runtime Error

B. Found

C. Compilation Error

D. Not Found

Solution

1. Step 1: Insert words "cat", "car", "dog" into Trie

   Each word is inserted character by character, creating nodes and marking end of word for last character.

2. Step 2: Search for "cat" in Trie

   Traversal finds nodes for 'c', 'a', 't' and confirms isEndOfWord is true, so returns true.

3. Final Answer:

   Found -> Option B

4. Quick Check:

   Inserted word found = Found [OK]

Hint: Search returns true if end flag is set after traversal [OK]

Common Mistakes:

• Not marking isEndOfWord true on insert
• Returning true without checking end flag
• Off-by-one errors in indexing

4. Identify the bug in the following Trie search function and select the correct fix:

bool search(string word) {
    TrieNode* node = root;
    for (char c : word) {
        int index = c - 'a';
        if (node->children[index])
            return false;
        node = node->children[index];
    }
    return node->isEndOfWord;
}

medium

A. Add a check for null root pointer before loop

B. Remove the return statement inside the loop

C. Change 'node = node->children[index];' to 'node = node->children[index + 1];'

D. Change 'if (node->children[index])' to 'if (!node->children[index])'

Solution

1. Step 1: Analyze the if condition inside loop

   The condition 'if (node->children[index]) return false;' wrongly returns false if child exists, which is opposite logic.

2. Step 2: Correct the condition to check if child does NOT exist

   It should be 'if (!node->children[index]) return false;' to return false when path breaks.

3. Final Answer:

   Change 'if (node->children[index])' to 'if (!node->children[index])' -> Option D

4. Quick Check:

   Check for missing child = return false [OK]

Hint: Return false if child node is missing, not if present [OK]

Common Mistakes:

• Returning false when child exists
• Ignoring null pointer checks
• Incorrect index calculation

5. Given a list of words: ["apple", "app", "application", "bat", "bath", "batman"], how can a Trie be used to efficiently find all words starting with the prefix "app"? Choose the best approach.

hard

A. Insert all words into Trie, then traverse nodes for 'a'->'p'->'p' and collect all descendant words

B. Sort the list and perform binary search for prefix "app"

C. Use a hash map to store all words and check prefix by substring

D. Store words in a linked list and scan each word for prefix match

Solution

1. Step 1: Insert all words into Trie

   Each word is inserted character by character, building a prefix tree.

2. Step 2: Traverse Trie nodes for prefix "app"

   Follow nodes for 'a', 'p', 'p' to reach prefix node, then collect all words below it.

3. Step 3: Collect descendant words

   Perform DFS or BFS from prefix node to gather all words starting with "app" efficiently.

4. Final Answer:

   Insert all words into Trie, then traverse nodes for 'a'->'p'->'p' and collect all descendant words -> Option A

5. Quick Check:

   Trie prefix traversal + collect descendants = Insert all words into Trie, then traverse nodes for 'a'->'p'->'p' and collect all descendant words [OK]

Hint: Traverse prefix nodes then gather descendants in Trie [OK]

Common Mistakes:

• Using sorting instead of Trie for prefix search
• Checking prefix by substring on all words
• Scanning linked list inefficiently