How to Fix Trie Autocomplete Errors

In this tutorial, you'll learn about How to Fix Trie Autocomplete Errors. We cover key concepts, practical examples, and best practices.

Fix trie autocomplete errors when DFS doesn't collect all words or collection stops before k results.

Quick Fix

Wrong

def auto(self,p):
    n=self
    for c in p:
        if c not in n.children: return []
        n=n.children[c]
    return self._dfs(n,p)
def _dfs(self,n,pre):
    res=[]
    if n.is_end: res.append(pre)
    for c,ch in n.children.items():
        res.extend(self._dfs(ch,pre+c))
    return res

Returns ALL words. No limit. Slow for large subtrees with common prefix.

Right

def auto(self,p,k):
    n=self
    for c in p:
        if c not in n.children: return []
        n=n.children[c]
    res=[]
    def dfs(node,pre):
        if len(res)>=k: return
        if node.is_end: res.append(pre)
        for c in sorted(node.children):
            dfs(node.children[c],pre+c)
    dfs(n,p)
    return res

Trie with 'cat','car','dog','care','catalog' -> auto('ca',3) -> ['car','care','cat']. O(k) output.

Prevention

Add early termination when k results collected. Sort children for consistent ordering.

DodaTech Tools

Doda Browser's algorithm visualizer steps through DSA operations line by line. DodaZIP archives implementation patterns for team sharing. Durga Antivirus Pro detects memory corruption patterns in algorithm implementations.

FAQ