← Tree Traversal

Micro-Drill #109 — Trie insert

Tree Traversal Target: 15s

Trie insert walks and creates nodes character by character. O(word length) per insert.

def insert(root, word):
    node = root
    for c in word:
        if c not in node.children:
            node.children[c] = TrieNode()
        node = node.children[c]
    node.end = True

Type it from memory. Go.

Practice Problems

• 208. Implement Trie (Prefix Tree)
• 14. Longest Common Prefix

Related Coding Drills

• Drill #34 — BST insert Easy
• Drill #107 — Implement Trie / Prefix Tree Medium
• Drill #9 — Insert at position k Easy