Trie Node Design and Initialization in DSA C

Mental Model

A trie node holds links to child nodes for each letter and a flag to mark if a word ends here.

Analogy: Imagine a tree where each branch splits into 26 smaller branches for each letter, and a flag on a branch tells if a word stops there.

root
 ↓
[ ] -> [ ] -> [ ] -> ... -> [ ]
Each [ ] is a child node pointer for a letter (a-z)
Each node has a flag: is_word_end (true/false)

Dry Run Walkthrough

Input: Create a trie node for the root with no children and not marking end of word

Goal: Initialize a trie node with all child pointers set to null and is_word_end set to false

Step 1: Allocate memory for a new trie node

Node allocated with empty children array and is_word_end unset

Why: We need a place in memory to store the node data

Step 2: Set all 26 child pointers to null

children: [null, null, null, ..., null] (26 times), is_word_end: false

Why: No children exist yet, so all pointers must start as null

Step 3: Set is_word_end flag to false

children: [null, null, ..., null], is_word_end: false

Why: This node does not mark the end of a word initially

Result:

children: [null, null, ..., null], is_word_end: false

Annotated Code

DSA C

#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>

#define ALPHABET_SIZE 26

typedef struct TrieNode {
    struct TrieNode* children[ALPHABET_SIZE];
    bool is_word_end;
} TrieNode;

// Function to create and initialize a new trie node
TrieNode* createNode() {
    TrieNode* node = (TrieNode*)malloc(sizeof(TrieNode));
    if (node) {
        for (int i = 0; i < ALPHABET_SIZE; i++) {
            node->children[i] = NULL;  // initialize all children to NULL
        }
        node->is_word_end = false;    // mark end of word as false
    }
    return node;
}

int main() {
    TrieNode* root = createNode();
    if (root == NULL) {
        printf("Memory allocation failed\n");
        return 1;
    }
    printf("Trie node created. is_word_end: %d\n", root->is_word_end);
    int null_count = 0;
    for (int i = 0; i < ALPHABET_SIZE; i++) {
        if (root->children[i] == NULL) {
            null_count++;
        }
    }
    printf("Number of NULL children: %d\n", null_count);
    free(root);
    return 0;
}

TrieNode* node = (TrieNode*)malloc(sizeof(TrieNode));

allocate memory for new trie node

for (int i = 0; i < ALPHABET_SIZE; i++) { node->children[i] = NULL; }

initialize all child pointers to null

node->is_word_end = false;

set end of word flag to false

Output

Trie node created. is_word_end: 0

Number of NULL children: 26

Complexity Analysis

Time: O(1) because initialization sets a fixed number (26) of child pointers

Space: O(1) for one node with fixed size array of 26 pointers and one boolean

vs Alternative: Compared to dynamic child storage (like linked lists), fixed array uses more space but allows faster access

Edge Cases

Memory allocation failure

createNode returns NULL and main handles it by printing error and exiting

DSA C

if (node) { ... } in createNode function

When to Use This Pattern

When you need to store many words sharing prefixes efficiently, use a trie node design with fixed child pointers and an end-of-word flag.

Common Mistakes

Mistake: Not initializing all child pointers to NULL, leading to undefined behavior
Fix: Explicitly set each child pointer to NULL in a loop during node creation

Summary

Creates a trie node with 26 child pointers all set to null and a flag marking word end as false.

Use when building a trie to store words by their letters with quick prefix access.

The key is to have a fixed-size array for children and a boolean flag to mark word endings.

Practice

1. What is the primary purpose of a Trie node in a Trie data structure?

easy

A. To store the length of the string

B. To store integer values for sorting

C. To hold pointers to parent nodes only

D. To store children nodes representing characters of strings

Solution

1. Step 1: Understand Trie node role

   A Trie node represents a character and links to children nodes for next characters in strings.

2. Step 2: Identify correct purpose

   It stores children nodes to build paths for strings, not integer values or lengths.

3. Final Answer:

   To store children nodes representing characters of strings -> Option D

4. Quick Check:

   Trie node = children nodes [OK]

Hint: Trie nodes link characters as children nodes [OK]

Common Mistakes:

• Thinking Trie nodes store whole strings
• Confusing with storing string length
• Assuming nodes only point to parents

2. Which of the following is the correct way to declare a Trie node struct in C with 26 children pointers and a boolean flag for end of word?

easy

A. typedef struct TrieNode { struct TrieNode* children[26]; int isEndOfWord; } TrieNode;

B. typedef struct TrieNode { struct TrieNode children[26]; int isEndOfWord; } TrieNode;

C. typedef struct TrieNode { struct TrieNode* children; int isEndOfWord; } TrieNode;

D. typedef struct TrieNode { struct TrieNode* children[26]; bool isEndOfWord; } TrieNode;

Solution

1. Step 1: Check children declaration

   Children must be pointers to TrieNode, so use struct TrieNode* children[26];

2. Step 2: Check end of word flag type

   Using int for boolean is common in C; bool requires stdbool.h and is less common.

3. Final Answer:

   typedef struct TrieNode { struct TrieNode* children[26]; int isEndOfWord; } TrieNode; -> Option A

4. Quick Check:

   Children pointers array + int flag = typedef struct TrieNode { struct TrieNode* children[26]; int isEndOfWord; } TrieNode; [OK]

Hint: Use pointers array for children and int for boolean in C [OK]

Common Mistakes:

• Declaring children as struct array instead of pointers
• Using bool without including stdbool.h
• Declaring children as single pointer instead of array

3. Given the following code snippet, what will be the output?

typedef struct TrieNode {
  struct TrieNode* children[26];
  int isEndOfWord;
} TrieNode;

TrieNode* getNode() {
  TrieNode* node = (TrieNode*)malloc(sizeof(TrieNode));
  node->isEndOfWord = 0;
  for (int i = 0; i < 26; i++)
    node->children[i] = NULL;
  return node;
}

int main() {
  TrieNode* root = getNode();
  printf("%d\n", root->isEndOfWord);
  printf("%p\n", root->children[0]);
  return 0;
}

medium

A. 1
0x0 (NULL pointer address)

B. Garbage value
Garbage pointer

C. 0
0x0 (NULL pointer address)

D. 0
Non-null pointer address

Solution

1. Step 1: Analyze getNode initialization

   isEndOfWord is set to 0 explicitly; children array elements set to NULL (0).

2. Step 2: Check main output

   Printing isEndOfWord prints 0; printing children[0] prints NULL pointer (0x0).

3. Final Answer:

   0 0x0 (NULL pointer address) -> Option C

4. Quick Check:

   Initialized zero and NULL = 0 0x0 (NULL pointer address) [OK]

Hint: Uninitialized pointers cause garbage; here all set NULL [OK]

Common Mistakes:

• Assuming uninitialized pointers have zero value
• Confusing isEndOfWord default value
• Expecting children pointers to have non-null addresses

4. Identify the error in the following Trie node initialization code and select the fix:

typedef struct TrieNode {
  struct TrieNode* children[26];
  int isEndOfWord;
} TrieNode;

TrieNode* getNode() {
  TrieNode* node = malloc(sizeof(TrieNode));
  node->isEndOfWord = 0;
  for (int i = 0; i <= 26; i++)
    node->children[i] = NULL;
  return node;
}

medium

A. Loop condition should be i < 26 to avoid out-of-bounds access

B. Missing cast for malloc return value

C. isEndOfWord should be initialized to 1

D. children array size should be 27

Solution

1. Step 1: Check loop bounds

   Loop runs from i = 0 to i <= 26, which means 27 iterations, but children array size is 26, causing out-of-bounds access.

2. Step 2: Identify correct fix

   Loop should run i < 26 to stay within array bounds and avoid memory errors.

3. Final Answer:

   Loop condition should be i < 26 to avoid out-of-bounds access -> Option A

4. Quick Check:

   Array size 26 means max index 25 [OK]

Hint: Array size 26 means loop i < 26, not <= 26 [OK]

Common Mistakes:

• Using <= instead of < in loops
• Ignoring array bounds causing runtime errors
• Assuming malloc cast is mandatory in C

5. You want to initialize a Trie node that supports lowercase English letters and also store the frequency of words ending at that node. Which of the following struct definitions correctly extends the basic Trie node design?

hard

A. typedef struct TrieNode { struct TrieNode* children[26]; bool isEndOfWord; int frequency; } TrieNode;

B. typedef struct TrieNode { struct TrieNode* children[26]; int isEndOfWord; int frequency; } TrieNode;

C. typedef struct TrieNode { struct TrieNode* children[26]; int frequency; } TrieNode;

D. typedef struct TrieNode { struct TrieNode* children[26]; int isEndOfWord; int* frequency; } TrieNode;

Solution

1. Step 1: Check children and end flag

   Children array of pointers size 26 is correct; isEndOfWord as int is standard in C.

2. Step 2: Add frequency field correctly

   Frequency should be an int to count occurrences; pointer to int is unnecessary complexity.

3. Final Answer:

   typedef struct TrieNode { struct TrieNode* children[26]; int isEndOfWord; int frequency; } TrieNode; -> Option B

4. Quick Check:

   Use int for frequency and isEndOfWord [OK]

Hint: Add int frequency field directly, keep isEndOfWord as int [OK]

Common Mistakes:

• Using pointer for frequency unnecessarily
• Omitting isEndOfWord flag
• Using bool without stdbool.h