Implementation of Prefix Tree (Trie) in Python along with insert and search operations

Prefix Tree.py

class Trie:
    def __init__(self):
        self.children = {}
        self.isEnd = False

    def insert(self, word):
        curr = self
        for w in word:
            if w not in curr.children:
                curr.children[w] = Trie()
            curr = curr.children[w]
        curr.isEnd = True

    def search(self, word):
        curr = self
        for w in word:
            if w not in curr.children:
                return False
            curr = curr.children[w]
        return curr.isEnd == True


root = Trie()
root.insert("TRIE")
print(root.search("TRIE"))