C++ beat 100%
\nTreeNode *find(TreeNode *node, int x) {\n\tif (node == NULL) return NULL;\n\tif (node->val == x) return node;\n\tTreeNode *left = find(node->left, x);\n\tTree
```\nTreeNode *find(TreeNode *node, int x) {\n\tif (node == NULL) return NULL;\n\tif (node->val == x) return node;\n\tTreeNode *left = find(node->left, x);\n\tTreeNode *right = find(node->right, x);\n\tif (left != NULL) return left;\n\treturn right;\n}\n\nint count(TreeNode *node) {\n\tif (node == NULL) return 0;\n\treturn 1 + count(node->left) + count(node->right);\n}\n\nbool btreeGameWinningMove(TreeNode* root, int n, int x) {\n\tTreeNode *node = find(root, x);\n\tint countLeft = count(node->left);\n\tint countRight = count(node->right);\n\tint rest = n - countLeft - countRight - 1;\n\treturn countLeft>(countRight+rest) || countRight>(rest+countLeft) || rest>(countLeft+countRight);\n}\n\n```
[]