Trie Node Design and Initialization in DSA Go - Build from Scratch

Trie Node Design and Initialization

📖 Scenario: Imagine you are building a simple phone directory app that stores contact names. To efficiently search names by their prefixes, you decide to use a Trie data structure.

🎯 Goal: Create a basic Trie node structure in Go that can hold children nodes for each letter and a flag to mark the end of a word.

📋 What You'll Learn

Define a struct called TrieNode with a map of children nodes

Include a boolean field isEndOfWord to mark complete words

Initialize a root node of type TrieNode

💡 Why This Matters

🌍 Real World

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

💼 Career

Understanding Trie node design is important for software engineers working on search engines, text processing, and network software.

1

Define the TrieNode struct

Define a struct called TrieNode with two fields: children which is a map from rune to *TrieNode, and isEndOfWord which is a boolean.

DSA Go

// Define the TrieNode struct here
// Your code here

Hint

Use type TrieNode struct {} to define the struct. The children map should use rune as key and pointer to TrieNode as value.

2

Create a function to initialize a new TrieNode

Write a function called NewTrieNode that returns a pointer to a TrieNode. Inside, initialize the children map as an empty map and set isEndOfWord to false.

DSA Go

package main

type TrieNode struct {
    children map[rune]*TrieNode
    isEndOfWord bool
}

// Write NewTrieNode function here
// Your code here

Hint

Use make(map[rune]*TrieNode) to initialize the children map inside the function.

3

Initialize the root node of the Trie

Create a variable called root and assign it the result of calling NewTrieNode().

DSA Go

package main

type TrieNode struct {
    children map[rune]*TrieNode
    isEndOfWord bool
}

func NewTrieNode() *TrieNode {
    return &TrieNode{
        children: make(map[rune]*TrieNode),
        isEndOfWord: false,
    }
}

// Initialize root node here
// Your code here

Hint

Use var root = NewTrieNode() to create the root node.

4

Print the initial state of the root node

Write a main function that prints the root variable.

DSA Go

package main

type TrieNode struct {
    children map[rune]*TrieNode
    isEndOfWord bool
}

func NewTrieNode() *TrieNode {
    return &TrieNode{
        children: make(map[rune]*TrieNode),
        isEndOfWord: false,
    }
}

var root = NewTrieNode()

func main() {
    // Print root node here
    // Your code here
}

Hint

Use println(root != nil) to confirm the root node is initialized.