Suffix Tree

# Note: A production-ready Suffix Tree is highly complex.
# This is a simplified version for conceptual understanding.

class SuffixTreeNode:
    def __init__(self):
        self.children = {}

class SuffixTree:
    def __init__(self, text):
        self.root = SuffixTreeNode()
        text += '$'  # Add a unique terminator
        for i in range(len(text)):
            self.insert_suffix(text[i:])

    def insert_suffix(self, suffix):
        node = self.root
        for char in suffix:
            if char not in node.children:
                node.children[char] = SuffixTreeNode()
            node = node.children[char]

    def has_substring(self, substring):
        node = self.root
        for char in substring:
            if char not in node.children:
                return False
            node = node.children[char]
        return True