How can I implement a trie data structure in Python?

How can I implement a trie data structure in Python?

To implement a trie in Python, you can start by creating a TrieNode class to represent each node.

What methods should I include in the Trie class?

You should include methods like insert, search, and delete to manage the trie.

Can you show me a simple implementation?

Sure! Here's a basic implementation:

class TrieNode:
    def __init__(self):
        self.children = {}
        self.is_end_of_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_end_of_word = True

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

How do I use this trie to find words with a specific prefix?

You can add a method called starts_with that checks if any word in the trie starts with a given prefix.