# 1145. 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.
``````

Constraints:

• `root` is the root of a binary tree with `n` nodes and distinct node values from `1` to `n`.
• `n` is odd.
• `1 <= x <= n <= 100`

``````class Solution {
public:
bool btreeGameWinningMove(TreeNode* root, int n, int x) {
int left = 0, right = 0;
helper(root, x, left, right);
return max(max(left, right), n - left - right - 1) > n / 2;
}
int helper(TreeNode* node, int x, int& left, int& right) {
if (!node) return 0;
int l = helper(node->left, x, left, right), r = helper(node->right, x, left, right);
if (node->val == x) {
left = l; right = r;
}
return l + r + 1;
}
};
``````

Github 同步地址:

https://github.com/grandyang/leetcode/issues/1145

https://leetcode.com/problems/binary-tree-coloring-game/

https://leetcode.com/problems/binary-tree-coloring-game/discuss/350738/Easy-to-understand-for-everyone

https://leetcode.com/problems/binary-tree-coloring-game/discuss/350570/JavaC%2B%2BPython-Simple-recursion-and-Follow-Up

LeetCode All in One 题目讲解汇总(持续更新中…)

 微信打赏 Venmo 打赏 （欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，试运营期间前五十位可享受半价优惠～） ×

Help us with donation  