← Tree Traversal

Micro-Drill #110 — Trie search

Tree Traversal Target: 10s

Trie search checks end flag at the final node. Distinguishes full words from prefixes.

def search(root, word):
    node = root
    for c in word:
        if c not in node.children:
            return False
        node = node.children[c]
    return node.end

Type it from memory. Go.

Practice Problems

• 208. Implement Trie (Prefix Tree)
• 211. Design Add and Search Words Data Structure

Related Coding Drills

• Drill #108 — Design Add and Search Words Medium
• Drill #107 — Implement Trie / Prefix Tree Medium
• Drill #35 — BST search Easy