Why Trie Exists and What Hash Map Cannot Do for Strings in DSA Typescript - Why It Works

Concept Flow - Why Trie Exists and What Hash Map Cannot Do for Strings

Start with strings collection

↓

Try Hash Map for string keys

↓

Problems: No prefix search, No ordered traversal

↓

Use Trie structure

↓

Store characters in nodes

↓

Traverse nodes by characters

↓

Efficient prefix search & ordered keys

Shows why hash maps fail for prefix and order tasks, and how tries solve these by storing strings character by character.

Execution Sample

DSA Typescript

const words = ['cat', 'car', 'dog'];
// Hash Map stores full words as keys
// Trie stores characters in nodes
// Trie allows prefix search like 'ca' -> ['cat', 'car']

Compares storing words in hash map vs trie to show prefix search advantage.

Execution Table

Step	Operation	Data Structure State	Pointer Changes	Visual State
1	Insert 'cat' in Hash Map	{ 'cat': true }	None	Hash Map: { 'cat' }
2	Insert 'car' in Hash Map	{ 'cat': true, 'car': true }	None	Hash Map: { 'cat', 'car' }
3	Prefix search 'ca' in Hash Map	{ 'cat': true, 'car': true }	None	No direct prefix search, must check all keys
4	Insert 'cat' in Trie	Root -> c -> a -> t (end)	Create nodes c, a, t	Trie: root - c - a - t*
5	Insert 'car' in Trie	Root -> c -> a -> t (end), r (end)	Create node r at 'a'	Trie: root - c - a - t*, r*
6	Prefix search 'ca' in Trie	Root -> c -> a	Traverse nodes c, a	Found prefix 'ca', words: ['cat', 'car']
7	Insert 'dog' in Trie	Root -> c -> a -> t*, r*; d -> o -> g*	Create nodes d, o, g	Trie: root - c - a - t*, r*; d - o - g*
8	Prefix search 'do' in Trie	Root -> d -> o	Traverse nodes d, o	Found prefix 'do', words: ['dog']
9	Ordered traversal in Trie	All nodes visited in lex order	Traverse all children in order	Words in order: ['car', 'cat', 'dog']
10	Ordered traversal in Hash Map	{ 'cat': true, 'car': true }	No order guaranteed	Words unordered: e.g. ['car', 'cat']
11	End	Final Trie and Hash Map states	No changes	Trie supports prefix and order; Hash Map does not

💡 Finished showing why Trie supports prefix search and ordered traversal, which Hash Map cannot do efficiently.

Variable Tracker

Variable	Start	After Step 4	After Step 5	After Step 7	Final
HashMap	{}	{ 'cat': true, 'car': true }	{ 'cat': true, 'car': true }	{ 'cat': true, 'car': true }	{ 'cat': true, 'car': true }
Trie Nodes	Root only	Root -> c -> a -> t*	Root -> c -> a -> t*, r*	Root -> c -> a -> t*, r*; d -> o -> g*	Root -> c -> a -> t*, r*; d -> o -> g*
Prefix Search Result for 'ca'	None	['cat']	['cat', 'car']	['cat', 'car']	['cat', 'car']
Prefix Search Result for 'do'	None	None	None	['dog']	['dog']

Key Moments - 3 Insights

Why can't a hash map efficiently find all words starting with a prefix like 'ca'?

Hash maps store whole strings as keys without structure, so prefix search requires checking every key, as shown in step 3 where no direct prefix search is possible.

How does a trie store strings differently to support prefix search?

Trie stores each character in a node linked to the next character, allowing traversal by prefix as in steps 4-6, enabling efficient prefix search.

Why does trie support ordered traversal but hash map does not?

Trie nodes are arranged by characters in lexicographical order, so traversing nodes in order visits words sorted, unlike hash map keys which have no guaranteed order (steps 9 and 10).

Visual Quiz - 3 Questions

Look at the execution table, what is the Trie state after inserting 'car' (Step 5)?

A Root -> d -> o -> g*

B Root -> c -> a -> t* only

C Root -> c -> a -> t*, r*

D Empty

💡 Hint

Check Step 5 row in execution_table under Visual State

At which step does prefix search for 'do' return a result?

A Step 3

B Step 8

C Step 6

D Step 10

💡 Hint

Look for prefix search 'do' in execution_table rows

If we used only a hash map, what would be the main problem for prefix search?

A No direct prefix search, must check all keys

B Hash map keys are ordered

C Hash map stores characters in nodes

D Hash map supports prefix search efficiently

💡 Hint

Refer to Step 3 in execution_table about prefix search in hash map

Concept Snapshot

Why Trie Exists and What Hash Map Cannot Do for Strings

- Hash Map stores full strings as keys, no prefix structure
- Trie stores strings character by character in nodes
- Trie supports fast prefix search by traversing nodes
- Trie allows ordered traversal of stored strings
- Hash Map cannot efficiently find all keys with a prefix
- Trie is ideal for prefix-based string operations

Full Transcript

This visual execution shows why tries exist and what hash maps cannot do for strings. Hash maps store entire strings as keys, so they cannot efficiently find all words starting with a prefix. Tries store each character in linked nodes, allowing traversal by prefix and ordered traversal of words. The execution table compares inserting words into hash map and trie, showing trie nodes growing character by character. Prefix searches in trie quickly find all words with a given prefix, unlike hash maps which must check all keys. This explains why tries are used for prefix search and ordered string storage, tasks hash maps cannot do efficiently.

Practice

1. Why do we use a Trie data structure instead of a Hash Map for storing many strings?

easy

A. Because Trie is faster for exact string lookups than Hash Maps

B. Because Trie uses less memory than a Hash Map for all cases

C. Because Hash Maps cannot store strings as keys

D. Because Trie efficiently supports prefix-based searches and auto-completion

Solution

1. Step 1: Understand Trie and Hash Map capabilities

   Trie stores strings in a tree form, allowing quick prefix searches. Hash Maps store keys but do not support prefix queries efficiently.

2. Step 2: Compare use cases for prefix search

   Trie can find all strings starting with a prefix quickly, which Hash Maps cannot do without scanning all keys.

3. Final Answer:

   Because Trie efficiently supports prefix-based searches and auto-completion -> Option D

4. Quick Check:

   Prefix search = Trie [OK]

Hint: Trie = prefix search; Hash Map = exact key lookup [OK]

Common Mistakes:

• Thinking Hash Maps support prefix search efficiently
• Assuming Trie always uses less memory
• Believing Hash Maps cannot store strings as keys

2. Which of the following is the correct TypeScript syntax to declare a Trie node with children as a Map of characters to nodes?

easy

A. class TrieNode { children: Map = new Map(); }

B. class TrieNode { children: Map = new Map(); }

C. class TrieNode { children: Map = new Map(); }

D. class TrieNode { children: Map = new Map(); }

Solution

1. Step 1: Understand Map type declaration in TypeScript

   Map keys and values must be typed as Map. Here keys are characters (string), values are TrieNode.

2. Step 2: Check each option's syntax

   class TrieNode { children: Map = new Map(); } correctly declares children as Map initialized with new Map(). Others have wrong generic order or types.

3. Final Answer:

   class TrieNode { children: Map = new Map(); } -> Option A

4. Quick Check:

   Map syntax correct [OK]

Hint: Map with correct order and initialization [OK]

Common Mistakes:

• Swapping key and value types in Map
• Not initializing Map with new Map()
• Using wrong generic types for Map

3. Given the following TypeScript Trie insertion code snippet, what will be the output after inserting words ['cat', 'car', 'dog'] and searching for prefix 'ca'?

class TrieNode {
  children: Map = new Map();
  isEnd: boolean = false;
}

class Trie {
  root = new TrieNode();

  insert(word: string) {
    let node = this.root;
    for (const ch of word) {
      if (!node.children.has(ch)) {
        node.children.set(ch, new TrieNode());
      }
      node = node.children.get(ch)!;
    }
    node.isEnd = true;
  }

  startsWith(prefix: string): boolean {
    let node = this.root;
    for (const ch of prefix) {
      if (!node.children.has(ch)) return false;
      node = node.children.get(ch)!;
    }
    return true;
  }
}

const trie = new Trie();
['cat', 'car', 'dog'].forEach(w => trie.insert(w));
console.log(trie.startsWith('ca'));

medium

A. undefined

B. true

C. false

D. Error at runtime

Solution

1. Step 1: Insert words into Trie

   Words 'cat', 'car', and 'dog' are inserted. 'ca' prefix nodes are created for 'c' and 'a'.

2. Step 2: Check startsWith for 'ca'

   Traversal finds nodes for 'c' and 'a' successfully, so returns true.

3. Final Answer:

   true -> Option B

4. Quick Check:

   Prefix 'ca' exists = true [OK]

Hint: If prefix nodes exist, startsWith returns true [OK]

Common Mistakes:

• Confusing startsWith with exact word search
• Assuming isEnd must be true for prefix check
• Expecting false if prefix is partial

4. The following TypeScript Trie search method is intended to check if a word exists. What is the bug?

search(word: string): boolean {
  let node = this.root;
  for (const ch of word) {
    if (!node.children.has(ch)) return false;
    node = node.children.get(ch)!;
  }
  return false;
}

medium

A. It always returns false even if word exists

B. It throws an error when word is empty

C. It returns true for any prefix, not full word

D. It does not check if node is null

Solution

1. Step 1: Analyze the return statement after loop

   The method returns false after the loop without checking if the last node marks end of a word.

2. Step 2: Identify missing isEnd check

   It should return node.isEnd to confirm full word presence, not just prefix.

3. Final Answer:

   It always returns false even if word exists -> Option A

4. Quick Check:

   Missing isEnd check causes always false [OK]

Hint: Check isEnd after traversal to confirm full word [OK]

Common Mistakes:

• Returning false without checking isEnd
• Confusing prefix search with full word search
• Ignoring empty string edge case

5. You want to store a large dictionary of words and quickly find all words starting with a given prefix. Why is a Trie better than a Hash Map for this, and what is a limitation of Hash Map in this scenario?

hard

A. Trie uses less memory than Hash Map; Hash Map cannot store string keys longer than 10 characters.

B. Trie supports exact word search only; Hash Map supports prefix search but slower.

C. Trie stores words in a prefix tree allowing fast prefix queries; Hash Map can't efficiently find keys by prefix without scanning all keys.

D. Trie is slower for insertion; Hash Map is faster for prefix search.

Solution

1. Step 1: Understand Trie prefix storage

   Trie organizes words by shared prefixes in a tree, enabling quick retrieval of all words with a prefix.

2. Step 2: Understand Hash Map limitations

   Hash Map stores keys without order, so prefix search requires checking all keys, which is inefficient.

3. Final Answer:

   Trie stores words in a prefix tree allowing fast prefix queries; Hash Map can't efficiently find keys by prefix without scanning all keys. -> Option C

4. Quick Check:

   Prefix search efficiency = Trie advantage [OK]

Hint: Trie = fast prefix search; Hash Map = no prefix search [OK]

Common Mistakes:

• Thinking Hash Map supports prefix search efficiently
• Assuming Trie uses less memory always
• Confusing exact search with prefix search