← Tree Traversal

Micro-Drill #112 — Trie delete (recursive)

Tree Traversal Target: 15s

Recursive trie deletion prunes empty branches. Checks if children remain before removing.

def delete(node, word, i=0):
    if i == len(word):
        node.end = False
        return len(node.children) == 0
    c = word[i]
    if delete(node.children[c], word, i+1):
        del node.children[c]
    return not node.end and len(node.children) == 0

Type it from memory. Go.

Practice Problems

• 208. Implement Trie (Prefix Tree)
• 648. Replace Words

Related Coding Drills

• Drill #10 — Delete node at position k Easy
• Drill #107 — Implement Trie / Prefix Tree Medium
• Drill #43 — DFS recursive Easy