Solving Binary Tree Coloring Game in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

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:

See the full details of the problem Binary Tree Coloring Game at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go