Clean Easy Understand Python
\tdef init(self, root: TreeNode):\n        root.val = 0\n        self.s = set()\n        q = [(root, 0)]\n        self.s.add(0)\n        while len(q) > 0:\n    
\tdef __init__(self, root: TreeNode):\n        root.val = 0\n        self.s = set()\n        q = [(root, 0)]\n        self.s.add(0)\n        while len(q) > 0:\n            t,v = q.pop()\n            if t.left:\n                q.append((t.left, v * 2 + 1))\n                self.s.add(v * 2 + 1)\n            if t.right:\n                q.append((t.right, v * 2 + 2))\n                self.s.add(v * 2 + 2)\n\n    def find(self, target: int) -> bool:\n        return target in self.s
[]