Why Trie Exists and What Hash Map Cannot Do for Strings in DSA C++ - Performance Analysis

Time Complexity: Why Trie Exists and What Hash Map Cannot Do for Strings

O(n)

Understanding Time Complexity

We want to understand why tries are used for strings instead of hash maps.

What makes tries better for some string tasks?

Scenario Under Consideration

Analyze the time complexity of inserting and searching strings in a trie.

struct TrieNode {
    TrieNode* children[26] = {nullptr};
    bool isEnd = false;
};

void insert(TrieNode* root, const std::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->isEnd = true;
}
    

This code inserts a word into a trie by creating nodes for each character.

Identify Repeating Operations

Look at what repeats as input grows.

• Primary operation: Loop over each character in the string.
• How many times: Exactly once per character in the word.

How Execution Grows With Input

Execution grows with the length of the string, not the number of stored words.

Input Size (n = word length)	Approx. Operations
10	10 steps
100	100 steps
1000	1000 steps

Pattern observation: The time grows linearly with the length of the word.

Final Time Complexity

Time Complexity: O(n)

This means inserting or searching a word takes time proportional to its length, regardless of how many words are stored.

Common Mistake

[X] Wrong: "Hash maps always give faster string search than tries."

[OK] Correct: Hash maps depend on hashing the whole string, which can be slow for long strings and do not support prefix queries efficiently. Tries handle prefixes naturally and have predictable time based on string length.

Interview Connect

Understanding why tries exist helps you explain efficient string handling beyond simple lookups. This skill shows you can choose the right tool for different problems.

Self-Check

"What if we used a hash map that stores all prefixes of strings? How would the time complexity compare to a trie?"

Practice

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

easy

A. Because Trie is faster for all types of lookups compared to Hash Map

B. Because Trie uses less memory than Hash Map for all data types

C. Because Hash Map cannot store strings as keys

D. Because Trie supports efficient prefix search which Hash Map cannot do easily

Solution

1. Step 1: Understand Trie and Hash Map capabilities

   Trie stores strings in a tree form allowing prefix-based queries efficiently. Hash Map stores keys but does not support prefix queries efficiently.

2. Step 2: Compare prefix search ability

   Trie can quickly find all strings with a given prefix, while Hash Map requires checking each key individually.

3. Final Answer:

   Because Trie supports efficient prefix search which Hash Map cannot do easily -> Option D

4. Quick Check:

   Prefix search = Trie advantage [OK]

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

Common Mistakes:

• Thinking Hash Map cannot store strings as keys
• Assuming Trie always uses less memory
• Believing Trie is faster for all lookups

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

easy

A. struct TrieNode { TrieNode* children[26]; bool isEnd; };

B. struct TrieNode { map children; bool isEnd; };

C. struct TrieNode { vector children(26); bool isEnd; };

D. struct TrieNode { TrieNode children[26]; bool isEnd; };

Solution

1. Step 1: Understand Trie node structure for fixed alphabet

   For lowercase English letters, an array of 26 pointers is common to represent children nodes.

2. Step 2: Check syntax correctness

   struct TrieNode { TrieNode* children[26]; bool isEnd; }; correctly declares an array of 26 TrieNode pointers and a boolean flag.

3. Final Answer:

   struct TrieNode { TrieNode* children[26]; bool isEnd; }; -> Option A

4. Quick Check:

   Array of pointers + bool flag = struct TrieNode { TrieNode* children[26]; bool isEnd; }; [OK]

Hint: Use array of pointers for fixed alphabets in Trie nodes [OK]

Common Mistakes:

• Using vector with parentheses instead of braces
• Declaring children as objects instead of pointers
• Using map when array is simpler for fixed alphabets

3. Consider the following C++ code snippet using a Trie to insert and search strings. What will be the output?

struct TrieNode {
  TrieNode* children[26] = {nullptr};
  bool isEnd = false;
};

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

int main() {
  Trie trie;
  trie.insert("apple");
  cout << trie.search("app") << " ";
  cout << trie.search("apple") << " ";
  trie.insert("app");
  cout << trie.search("app") << endl;
  return 0;
}

medium

A. 1 0 0

B. 0 1 1

C. 0 0 1

D. 1 1 1

Solution

1. Step 1: Trace insertions and searches

   After inserting "apple", searching "app" returns false because "app" is not marked as end. Searching "apple" returns true. After inserting "app", searching "app" returns true.

2. Step 2: Match outputs with options

   Outputs are: 0 (false), 1 (true), 1 (true) matching 0 1 1.

3. Final Answer:

   0 1 1 -> Option B

4. Quick Check:

   Search "app" before insert = 0, after insert = 1 [OK]

Hint: Check isEnd flag for exact word match in Trie search [OK]

Common Mistakes:

• Assuming prefix search returns true without isEnd
• Confusing insert order effects
• Ignoring isEnd flag in search

4. The following Trie insertion code has a bug. What is the error?

void insert(string word) {
  TrieNode* node = root;
  for (int i = 0; i <= word.size(); i++) {
    int idx = word[i] - 'a';
    if (!node->children[idx])
      node->children[idx] = new TrieNode();
    node = node->children[idx];
  }
  node->isEnd = true;
}

medium

A. Loop runs one extra iteration causing out-of-bounds access

B. Children array is not initialized to nullptr

C. isEnd flag is set before last character insertion

D. Index calculation should be 'a' - word[i] instead of word[i] - 'a'

Solution

1. Step 1: Analyze loop boundary

   The loop runs from i = 0 to i <= word.size(), which means it accesses word[word.size()] causing out-of-bounds error.

2. Step 2: Identify correct loop condition

   The loop should run i < word.size() to avoid invalid access.

3. Final Answer:

   Loop runs one extra iteration causing out-of-bounds access -> Option A

4. Quick Check:

   Loop boundary off by one = Loop runs one extra iteration causing out-of-bounds access [OK]

Hint: Use i < size(), not i <= size() for string indexing [OK]

Common Mistakes:

• Ignoring off-by-one errors in loops
• Confusing index calculation signs
• Assuming children array auto-initializes

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 would you implement the prefix search?

hard

A. Trie stores words in sorted order; implement prefix search by binary search on keys

B. Hash Map stores keys with prefix hashing; implement prefix search by hashing prefix and returning all keys

C. Trie stores words in a tree allowing prefix traversal; implement prefix search by traversing nodes for prefix then DFS for all descendants

D. Hash Map supports prefix search natively; implement prefix search by direct lookup

Solution

1. Step 1: Understand Trie prefix storage

   Trie nodes represent characters; prefix corresponds to a path in the Trie. This allows direct traversal to prefix node.

2. Step 2: Implement prefix search

   Traverse Trie nodes for prefix characters, then perform DFS from that node to collect all words starting with prefix.

3. Step 3: Compare with Hash Map

   Hash Map keys are unordered; no direct way to find all keys with a prefix without checking all keys.

4. Final Answer:

   Trie stores words in a tree allowing prefix traversal; implement prefix search by traversing nodes for prefix then DFS for all descendants -> Option C

5. Quick Check:

   Prefix traversal + DFS = Trie advantage [OK]

Hint: Use Trie traversal + DFS for prefix search, Hash Map can't do this fast [OK]

Common Mistakes:

• Assuming Hash Map supports prefix search directly
• Confusing Trie with sorted array binary search
• Ignoring need to explore descendants after prefix