Why Trie Exists and What Hash Map Cannot Do for Strings in DSA Rust - See It Work

Why Trie Exists and What Hash Map Cannot Do for Strings

📖 Scenario: Imagine you are building a search feature for a phone contacts app. You want to quickly find all contacts whose names start with a few letters typed by the user.Using a hash map to store contacts by full name works well for exact matches but struggles when you want to find all names starting with a prefix.

🎯 Goal: Build a simple prefix search using a Trie data structure to find all contact names starting with a given prefix.This will show why a Trie is useful and what a hash map cannot do easily for strings.

📋 What You'll Learn

Create a Trie node structure to store characters and children

Add contact names to the Trie

Search the Trie for all names starting with a given prefix

Print the list of matching contact names

💡 Why This Matters

🌍 Real World

Tries are used in search engines, autocomplete, spell checkers, and IP routing to quickly find words or prefixes.

💼 Career

Understanding Tries helps in roles involving text processing, search optimization, and building efficient data retrieval systems.

1

Create a Trie Node Structure

Create a struct called TrieNode with a field children as a HashMap<char, Box<TrieNode>> and a boolean field is_end_of_word set to false.

DSA Rust

# Your code here to define struct TrieNode with children and is_end_of_word

Hint

Use HashMap<char, Box<TrieNode>> for children to store next letters.

Initialize is_end_of_word as false in new().

2

Add Contact Names to the Trie

Add a method insert(&mut self, word: &str) to TrieNode that inserts each character of word into the Trie, creating new nodes as needed, and marks the last node's is_end_of_word as true.

DSA Rust

use std::collections::HashMap;

struct TrieNode {
    children: HashMap>,
    is_end_of_word: bool,
}

impl TrieNode {
    fn new() -> Self {
        TrieNode {
            children: HashMap::new(),
            is_end_of_word: false,
        }
    }

    // Add insert method here
    // Your code here

Hint

Use entry(ch).or_insert_with(|| Box::new(TrieNode::new())) to add new nodes.

Mark is_end_of_word true after inserting all characters.

3

Search for Names Starting with a Prefix

Add a method search_prefix(&self, prefix: &str) -> Option<&TrieNode> to TrieNode that returns the node where the prefix ends or None if prefix not found.

DSA Rust

use std::collections::HashMap;

struct TrieNode {
    children: HashMap>,
    is_end_of_word: bool,
}

impl TrieNode {
    fn new() -> Self {
        TrieNode {
            children: HashMap::new(),
            is_end_of_word: false,
        }
    }

    fn insert(&mut self, word: &str) {
        let mut current = self;
        for ch in word.chars() {
            current = current.children.entry(ch).or_insert_with(|| Box::new(TrieNode::new()));
        }
        current.is_end_of_word = true;
    }

    // Add search_prefix method here
    // Your code here

Hint

Use children.get(&ch) to move down the Trie.

Return None if any character is missing.

4

Print All Contact Names Starting with a Prefix

Add a method collect_words(&self, prefix: &str, results: &mut Vec<String>) to TrieNode that collects all words starting from this node. Then, in main, insert these contacts: "alice", "alex", "bob", "bobby", search for prefix "al", collect matching names, and print the list.

DSA Rust

use std::collections::HashMap;

struct TrieNode {
    children: HashMap>,
    is_end_of_word: bool,
}

impl TrieNode {
    fn new() -> Self {
        TrieNode {
            children: HashMap::new(),
            is_end_of_word: false,
        }
    }

    fn insert(&mut self, word: &str) {
        let mut current = self;
        for ch in word.chars() {
            current = current.children.entry(ch).or_insert_with(|| Box::new(TrieNode::new()));
        }
        current.is_end_of_word = true;
    }

    fn search_prefix(&self, prefix: &str) -> Option {
        let mut current = self;
        for ch in prefix.chars() {
            match current.children.get(&ch) {
                Some(node) => current = node,
                None => return None,
            }
        }
        Some(current)
    }

    // Add collect_words method here
    // Your code here
}

fn main() {
    let mut trie = TrieNode::new();
    // Insert contacts here
    // Search prefix and collect results
    // Print results
    // Your code here
}

Hint

Use recursion in collect_words to gather all words from the current node.

In main, insert the exact contacts, search prefix "al", collect results, and print them.

Practice

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

easy

A. Because Hash Map can only store numbers, not strings

B. Because Hash Map uses less memory than Trie

C. Because Trie stores strings as keys directly without splitting

D. Because Trie can efficiently find all strings with a common prefix

Solution

1. Step 1: Understand Trie prefix search ability

   Trie stores strings character by character, allowing quick prefix-based searches.

2. Step 2: Compare with Hash Map capabilities

   Hash Map stores whole strings as keys but cannot efficiently find all keys sharing a prefix.

3. Final Answer:

   Because Trie can efficiently find all strings with a common prefix -> Option D

4. Quick Check:

   Trie = prefix search [OK]

Hint: Trie excels at prefix search, Hash Map does not [OK]

Common Mistakes:

• Thinking Hash Map can do prefix search efficiently
• Confusing memory usage advantages
• Believing Trie stores whole strings as keys

2. Which of the following is the correct way to declare a Trie node struct in Rust for lowercase English letters?

easy

A. struct TrieNode { children: [Option; 26], is_end: bool }

B. struct TrieNode { children: Vec<TrieNode>, is_end: bool }

C. struct TrieNode { children: HashMap, is_end: bool }

D. struct TrieNode { children: [TrieNode; 26], is_end: bool }

Solution

1. Step 1: Understand Rust ownership and recursive types

   Recursive structs need Box to allocate on heap to avoid infinite size.

2. Step 2: Check array size and type

   Array of 26 Option fits lowercase letters and allows empty children.

3. Final Answer:

   struct TrieNode { children: [Option; 26], is_end: bool } -> Option A

4. Quick Check:

   Use Box and Option for recursive children [OK]

Hint: Use Box and Option for recursive children array [OK]

Common Mistakes:

• Using Vec without Box causes infinite size error
• Using HashMap instead of fixed array for fixed alphabet
• Using array of TrieNode directly without Box

3. What will be the output of the following Rust code snippet using a Trie to insert and search strings?

let mut trie = Trie::new();
trie.insert("cat");
trie.insert("car");
trie.insert("dog");
println!("{}", trie.starts_with("ca"));
println!("{}", trie.starts_with("do"));
println!("{}", trie.starts_with("bat"));

medium

A. true
false
false

B. false
true
false

C. true
true
false

D. false
false
true

Solution

1. Step 1: Insert strings into Trie

   Strings "cat", "car", and "dog" are inserted, so prefixes "ca" and "do" exist.

2. Step 2: Check starts_with queries

   "ca" matches "cat" and "car" (true), "do" matches "dog" (true), "bat" not inserted (false).

3. Final Answer:

   true true false -> Option C

4. Quick Check:

   Prefix search matches inserted prefixes [OK]

Hint: Inserted prefixes return true on starts_with [OK]

Common Mistakes:

• Assuming starts_with returns true only for full words
• Confusing starts_with with exact search
• Mixing up true/false outputs

4. Given this Rust Trie insert function snippet, what is the bug?

fn insert(&mut self, word: &str) {
  let mut node = &mut self.root;
  for c in word.chars() {
    let index = (c as usize) - ('a' as usize);
    if node.children[index].is_none() {
      node.children[index] = Some(Box::new(TrieNode::new()));
    }
    node = &mut node.children[index].as_mut().unwrap();
  }
  node.is_end = true;
}

medium

A. The index calculation assumes only lowercase letters without validation

B. The unwrap() call can cause a panic if children[index] is None

C. The loop should iterate over bytes, not chars

D. The is_end flag is set before the loop

Solution

1. Step 1: Analyze index calculation

   Index is calculated by subtracting 'a' from character code, assuming lowercase letters only.

2. Step 2: Identify missing validation

   No check if character is lowercase a-z, so uppercase or other chars cause wrong index or panic.

3. Final Answer:

   The index calculation assumes only lowercase letters without validation -> Option A

4. Quick Check:

   Index must be validated for safe access [OK]

Hint: Check character range before index calculation [OK]

Common Mistakes:

• Ignoring character validation causes panic
• Thinking unwrap() is unsafe here (it's safe after check)
• Confusing iteration over chars vs bytes

5. You want to find all words in a dictionary that start with a given prefix efficiently. Why is a Trie better than a Hash Map for this task, and how does it achieve this?

hard

A. Trie uses less memory than Hash Map for storing strings; Hash Map stores full strings wasting space

B. Trie stores words character by character, enabling fast prefix traversal; Hash Map cannot efficiently list keys by prefix

C. Trie hashes prefixes for quick lookup; Hash Map hashes full strings only

D. Trie sorts all words internally; Hash Map stores words unsorted

Solution

1. Step 1: Understand Trie's character-by-character storage

   Trie nodes represent characters, so traversing nodes follows prefix paths quickly.

2. Step 2: Compare with Hash Map key storage

   Hash Map keys are full strings; no structure to find all keys sharing a prefix efficiently.

3. Step 3: Explain prefix search advantage

   Trie traversal to prefix node then explores subtree for all matching words efficiently.

4. Final Answer:

   Trie stores words character by character, enabling fast prefix traversal; Hash Map cannot efficiently list keys by prefix -> Option B

5. Quick Check:

   Trie = prefix traversal, Hash Map = no prefix listing [OK]

Hint: Trie traverses prefix nodes; Hash Map cannot list by prefix [OK]

Common Mistakes:

• Assuming Hash Map can list keys by prefix efficiently
• Confusing hashing with prefix traversal
• Thinking Trie sorts words internally