easy to understand C++ and 100% runtime
```TreeNode tg=NULL;\n    int rec(TreeNode root){\n        if(root==NULL)return 0;\n        return rec(root->left)+rec(root->right)+1;\n    }\n    \n    void fi
```TreeNode* tg=NULL;\n    int rec(TreeNode* root){\n        if(root==NULL)return 0;\n        return rec(root->left)+rec(root->right)+1;\n    }\n    \n    void fi(TreeNode* root,int x){\n        if(root==NULL)return;\n        if(root->val==x){\n            tg=root;\n            return;\n        }\n        fi(root->right,x);\n        fi(root->left,x);\n    }\n    \n    bool btreeGameWinningMove(TreeNode* root, int n, int x) {\n        tg=NULL;\n        fi(root,x);\n        if(tg==NULL)return false;\n        int b=rec(tg->right);\n        int c=rec(tg->left);\n        int a=n-b-c-1;\n        if(a>b+c || b>a+c || c>a+b)return true;\n        return false;\n    }
['Recursion', 'C']