Simple Java Solution using DFS | Easy to Understand
Please upvote, if you find it useful :)\n\n\nclass Solution {\n    \n    public int xleft;\n    public int xright;\n    \n    public int size(TreeNode node, int
Please upvote, if you find it useful :)\n\n```\nclass Solution {\n    \n    public int xleft;\n    public int xright;\n    \n    public int size(TreeNode node, int x) {\n        if(node == null) {\n            return 0;\n        }\n        \n        int ls = size(node.left, x);\n        int rs = size(node.right, x);\n        \n        if(node.val == x){\n            xleft = ls;\n            xright = rs;\n        }\n        \n        return ls + rs + 1;\n    }\n    \n    public boolean btreeGameWinningMove(TreeNode root, int n, int x) {\n        size(root, x);\n        int otherSize = n - xleft - xright - 1;\n        int max = Math.max(otherSize, Math.max(xleft, xright));\n        \n        int rest = n - max;\n        if(max > rest) {\n            return true;\n        }\n        \n        return false;\n    }\n}\n```
['Depth-First Search', 'Java']