Python3 82.89% (28 ms)/100.00% (13.8 MB) -- O(n) time/O(h) space (recursion) -- 3 counters
\nclass Solution:\n    def count_nodes(self, node, counters, index, x):\n        if (node):\n            if (node.val == x):\n                self.count_nodes(n
```\nclass Solution:\n    def count_nodes(self, node, counters, index, x):\n        if (node):\n            if (node.val == x):\n                self.count_nodes(node.left, counters, 1, x)\n                self.count_nodes(node.right, counters, 2, x)\n            else:\n                counters[index] += 1\n                self.count_nodes(node.left, counters, index, x)\n                self.count_nodes(node.right, counters, index, x)\n           \n        \n        \n    def btreeGameWinningMove(self, root: TreeNode, n: int, x: int) -> bool:\n        counters = [0, 0, 0]\n        self.count_nodes(root, counters, 0, x)\n        counters.sort()\n        return counters[2] > 1 + counters[1] + counters[0]\n```
[]