package leetcode;

/**
 * https://leetcode.com/problems/binary-tree-coloring-game/
 */
public class Problem1145 {
    public static class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;

        TreeNode(int x) {
            val = x;
        }
    }

    public boolean btreeGameWinningMove(TreeNode root, int n, int x) {
        // TODO
        return false;
    }

    public static void main(String[] args) {
        Problem1145 prob = new Problem1145();
    }
}

@@ -477,16 +477,653 @@
 m1145();
+%0A%0A        TreeNode root = new TreeNode(1);%0A        root.left = new TreeNode(2);%0A        root.right = new TreeNode(3);%0A        root.left.left = new TreeNode(4);%0A        root.left.right = new TreeNode(5);%0A        root.right.left = new TreeNode(6);%0A        root.right.right = new TreeNode(7);%0A        root.left.left.left = new TreeNode(8);%0A        root.left.left.right = new TreeNode(9);%0A        root.left.right.left = new TreeNode(10);%0A        root.left.right.right = new TreeNode(11);%0A%0A        System.out.println(prob.btreeGameWinningMove(root, 11, 3)); // true%0A        System.out.println(prob.btreeGameWinningMove(root, 11, 2)); // false
 %0A    %7D%0A%7D

Update problem 1145