JAVA  EASIEST 0 ms
\nclass Solution {\n  int left, right;\n    public boolean btreeGameWinningMove(TreeNode root, int n, int x) {\n        if(n==1)\n            return false;\n   
```\nclass Solution {\n  int left, right;\n    public boolean btreeGameWinningMove(TreeNode root, int n, int x) {\n        if(n==1)\n            return false;\n        if(n==2)\n            return false;\n        if(n==3)\n        {\n            if(x!=1)\n                return true;\n            return false;\n        }\n        count(root,x);\n        if(left+right+1<n/2)\n            return true;\n        if((left>n/2)||(right>n/2))\n            return true;\n        return false;\n    }\n\n    private int count(TreeNode node,int x) {\n        if (node == null) return 0;\n        int l = count(node.left,x), r = count(node.right,x);\n        if (node.val == x) {\n            left = l;\n            right = r;\n        }\n        return l + r + 1;\n    }\n}\n```
[]