How do I implement a generic trie in Go?

type TrieNode[T any] struct {
    Children map[rune]*TrieNode[T]
    Value    *T
}

type Trie[T any] struct {
    Root *TrieNode[T]
}

func NewTrie[T any]() *Trie[T] {
    return &Trie[T]{Root: &TrieNode[T]{Children: make(map[rune]*TrieNode[T])}}
}

func (t *Trie[T]) Insert(word string, value T) {
    node := t.Root
    for _, ch := range word {
        if _, exists := node.Children[ch]; !exists {
            node.Children[ch] = &TrieNode[T]{Children: make(map[rune]*TrieNode[T])}
        }
        node = node.Children[ch]
    }
    node.Value = &value
}

func (t *Trie[T]) Search(word string) *T {
    node := t.Root
    for _, ch := range word {
        if _, exists := node.Children[ch]; !exists {
            return nil
        }
        node = node.Children[ch]
    }
    return node.Value
}