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.  nis 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

思路：求出每个节点的degree（即所有child节点的总数）

如果第一个人选的node的degree小于总数的一半，第二个人选parent node就可以win

如果第一个人选的node的degree大于总数的一半，而且这个node.left或者node.right的degree大于一半，第二个只要选择这个子节点就可以win

否则，第一个人第二次选的时候会占据有利位置，这样的话他就赢了

# Definition for a binary tree node.
class TreeNode(object):
    def __init__(self, x):
        self.val = x
        self.left = None
        self.right = None

class Solution(object):
    def btreeGameWinningMove(self, root, n, x):
        """
        :type root: TreeNode
        :type n: int
        :type x: int
        :rtype: bool
        """
        degree = {}
        def helper(r):
            if not r: return 0
            left = helper(r.left)
            right = helper(r.right)
            res = 1+left+right
            degree[r.val]=(res,left,right)
            return res
        helper(root)
        
        if degree[x][0]<=n//2: return True
        if max(degree[x][1], degree[x][2])>n//2: return True
        return False