Binary Tree Coloring Game

Two players play a turn based game on a binary tree.  We are given the root of this binary tree, and the number of nodes n in the tree.  n is odd, and each node has a distinct value from 1 to n.

Initially, the first player names a value x with 1 <= x <= n, and the second player names a value y with 1 <= y <= n and y != x.  The first player colors the node with value x red, and the second player colors the node with value y blue.

Then, the players take turns starting with the first player.  In each turn, that player chooses a node of their color (red if player 1, blue if player 2) and colors an uncolored neighbor of the chosen node (either the left child, right child, or parent of the chosen node.)

If (and only if) a player cannot choose such a node in this way, they must pass their turn.  If both players pass their turn, the game ends, and the winner is the player that colored more nodes.

You are the second player.  If it is possible to choose such a y to ensure you win the game, return true.  If it is not possible, return false.

Example 1:

Input: root = [1,2,3,4,5,6,7,8,9,10,11], n = 11, x = 3
Output: true
Explanation: The second player can choose the node with value 2.

思路：就是红色的点放下之后，蓝色的点只有三个位置，parent，left，right三个位子去围堵红色，那么三个方向只要有一个所控制的区域能够大于n / 2，就代表蓝色的会赢。怎么求parent控制的范围，是用n - 红色left - 红色right - 1 

DFS也就是求包含这个node一下所有的node数目；

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    private int xleft = 0;
    private int xright = 0;
    public boolean btreeGameWinningMove(TreeNode root, int n, int x) {
        if(root == null) {
            return false;
        }
        dfs(root, x);
        return Math.max(n - xleft - xright - 1, Math.max(xleft, xright)) > n / 2;
    }
    
    private int dfs(TreeNode node, int x) {
        if(node == null) {
            return 0;
        }
        int leftcount = dfs(node.left, x);
        int rightcount = dfs(node.right, x);
        if(node.val == x) {
            xleft = leftcount;
            xright = rightcount;
        }
        return leftcount + rightcount + 1;
    }
}