C++ || Easy Solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\n/**\n * Definition for a binary tree node.\n * struct TreeNode {\n *     int val;\n *     TreeNode *left;\n *     TreeNode *right;\n *     TreeNode() : val(0), left(nullptr), right(nullptr) {}\n *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}\n *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}\n * };\n */\nclass Solution {\npublic:\n    int l=0,r=0;\n    int fun(TreeNode*root,int x){\n        if(root==NULL)return 0;\n        int left=fun(root->left,x);\n        int right=fun(root->right,x);\n        if(root->val==x){\n            l=left;\n            r=right;\n        }\n        return left+right+1;\n    }\n    bool btreeGameWinningMove(TreeNode* root, int n, int x) {\n        fun(root,x);\n        int p=n-(l+r+1);\n        int node=max(p,max(l,r));\n        if(node>n/2)\n        return true;\n        return false;\n    }\n};\n```
['C++']