Why Word Search in Trie in DSA Javascript?

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 takes a lot of time to check each word, and you might make mistakes or miss words because of the long list.

The Solution

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

Before vs After

✗ Before

function searchWord(words, target) {
  for (let word of words) {
    if (word === target) return true;
  }
  return false;
}

✓ After

class TrieNode {
  constructor() {
    this.children = {};
    this.isWord = false;
  }
}

class Trie {
  constructor() {
    this.root = new TrieNode();
  }
  insert(word) {
    let current = this.root;
    for (let letter of word) {
      if (!current.children[letter]) {
        current.children[letter] = new TrieNode();
      }
      current = current.children[letter];
    }
    current.isWord = true;
  }
  search(word) {
    let current = this.root;
    for (let letter of word) {
      if (!current.children[letter]) return false;
      current = current.children[letter];
    }
    return current.isWord;
  }
}

What It Enables

With a Trie, you can find words instantly, even in huge lists, making searching fast and reliable.

Real Life Example

When you type on your phone keyboard, the system quickly suggests words by searching a Trie of all possible words, so you get instant suggestions.

Key Takeaways

Manual word search is slow and error-prone.

Trie organizes words by letters for fast searching.

Using Trie makes word search quick and efficient.

Practice

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

easy

A. To efficiently store and search words by their prefixes

B. To sort words alphabetically

C. To store words in a hash table

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.

2. Step 2: Identify Trie usage

   It allows quick prefix-based search by traversing nodes matching characters.

3. Final Answer:

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

4. Quick Check:

   Trie = prefix search [OK]

Hint: Trie is all about prefix-based fast word search [OK]

Common Mistakes:

• Confusing Trie with hash tables
• Thinking Trie sorts words
• Assuming Trie does arithmetic

2. Which of the following is the correct way to check if a word exists in a Trie in JavaScript?

easy

A. Use a loop to traverse nodes matching each character and check end flag

B. Use Array.includes(word) on the Trie object

C. Use JSON.stringify on Trie and search substring

D. Use Math.max on character codes of the word

Solution

1. Step 1: Understand Trie search method

   Search involves traversing nodes for each character and checking if the word ends at last node.

2. Step 2: Eliminate incorrect options

   Array.includes and JSON.stringify are not suitable for Trie structure. Math.max is unrelated.

3. Final Answer:

   Use a loop to traverse nodes matching each character and check end flag -> Option A

4. Quick Check:

   Traverse nodes + check end = correct search [OK]

Hint: Traverse each character node and check end flag [OK]

Common Mistakes:

• Using array methods on Trie
• Trying to convert Trie to string
• Applying math functions on words

3. What will be the output of the following code snippet?

class TrieNode {
  constructor() {
    this.children = {};
    this.isEnd = false;
  }
}

class Trie {
  constructor() {
    this.root = new TrieNode();
  }
  insert(word) {
    let node = this.root;
    for (const char of word) {
      if (!node.children[char]) node.children[char] = new TrieNode();
      node = node.children[char];
    }
    node.isEnd = true;
  }
  search(word) {
    let node = this.root;
    for (const char of word) {
      if (!node.children[char]) return false;
      node = node.children[char];
    }
    return node.isEnd;
  }
}

const trie = new Trie();
trie.insert('cat');
trie.insert('car');
console.log(trie.search('cat'));
console.log(trie.search('cap'));

medium

A. false false

B. false true

C. true false

D. true true

Solution

1. Step 1: Insert words 'cat' and 'car'

   Both words are added character by character, marking end nodes for 't' and 'r'.

2. Step 2: Search 'cat' and 'cap'

   'cat' exists with isEnd true, 'cap' path breaks at 'p' missing node, returns false.

3. Final Answer:

   true false -> Option C

4. Quick Check:

   Search 'cat' = true, 'cap' = false [OK]

Hint: Check inserted words and search path carefully [OK]

Common Mistakes:

• Assuming 'cap' exists after inserting 'car'
• Confusing isEnd flag
• Ignoring missing child nodes

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

search(word) {
  let node = this.root;
  for (const char of word) {
    if (!node.children[char]) return false;
    node = node.children[char];
  }
  return true;
}

medium

A. Return false at the end instead of true

B. Add a check for empty word before loop

C. Change for loop to while loop

D. Return node.isEnd instead of true to confirm full word match

Solution

1. Step 1: Analyze current search return

   Returns true if path exists but does not check if word ends here.

2. Step 2: Correct return value

   Must return node.isEnd to confirm the word is complete, not just prefix.

3. Final Answer:

   Return node.isEnd instead of true to confirm full word match -> Option D

4. Quick Check:

   Check isEnd flag to confirm word end [OK]

Hint: Always check isEnd flag to confirm full word [OK]

Common Mistakes:

• Returning true without checking isEnd
• Changing loop type unnecessarily
• Ignoring empty word cases

5. Given a list of words, how can you use a Trie to find all words that start with a given prefix efficiently? Choose the best approach.

hard

A. Sort words and use binary search on prefix

B. Insert all words into Trie, traverse prefix nodes, then collect all descendant words

C. Use a hash map with prefix keys for direct lookup

D. Check each word in list if it starts with prefix using string methods

Solution

1. Step 1: Insert all words into Trie

   Build Trie so each word is represented by a path of nodes.

2. Step 2: Traverse prefix nodes and collect words

   Find node matching prefix end, then recursively collect all words below it.

3. Step 3: Compare other options

   Sorting and binary search is possible but less efficient for many queries. Hash maps need many keys. Checking each word is slow.

4. Final Answer:

   Insert all words into Trie, traverse prefix nodes, then collect all descendant words -> Option B

5. Quick Check:

   Trie + prefix traversal = efficient prefix search [OK]

Hint: Use Trie prefix traversal then gather descendant words [OK]

Common Mistakes:

• Ignoring Trie traversal for prefix
• Using slow linear search for prefix
• Confusing hash map with Trie