收集Trie节点下所有完整单词的后缀(在Python中使用递归)

class TrieNode:
    def __init__(self):
        self.children = {}
        self.is_word = False


class Trie:
    def __init__(self):
        self.root = TrieNode()

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

    def find_suffix(self, node, prefix):
        result = []
        if node.is_word:
            result.append(prefix)

        for char, child_node in node.children.items():
            result.extend(self.find_suffix(child_node, prefix + char))

        return result


def collect_suffixes(trie, prefix):
    node = trie.root
    for char in prefix:
        if char not in node.children:
            return []
        node = node.children[char]

    return trie.find_suffix(node, prefix)


# 示例用法
trie = Trie()
words = ["apple", "banana", "app", "bat", "ball"]
for word in words:
    trie.insert(word)

prefix = "ap"
suffixes = collect_suffixes(trie, prefix)
print(suffixes)