package leetcode;

/**
 * https://leetcode.com/problems/flip-equivalent-binary-trees/
 */
public class Problem951 {
    public static class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;

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

    public boolean flipEquiv(TreeNode root1, TreeNode root2) {
        // TODO
        return false;
    }

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

@@ -470,16 +470,786 @@
 m951();%0A
+        TreeNode root1 = new TreeNode(1);%0A        root1.left = new TreeNode(2);%0A        root1.left.left = new TreeNode(4);%0A        root1.left.right = new TreeNode(5);%0A        root1.left.right.left = new TreeNode(7);%0A        root1.left.right.right = new TreeNode(8);%0A        root1.right = new TreeNode(3);%0A        root1.right.left = new TreeNode(6);%0A%0A        TreeNode root2 = new TreeNode(1);%0A        root2.left = new TreeNode(3);%0A        root2.left.right = new TreeNode(6);%0A        root2.right = new TreeNode(2);%0A        root2.right.left = new TreeNode(4);%0A        root2.right.right = new TreeNode(5);%0A        root2.right.right.left = new TreeNode(8);%0A        root2.right.right.right = new TreeNode(7);%0A%0A        System.out.println(prob.flipEquiv(root1, root2)); // true%0A
     %7D%0A%7D%0A

Update problem 951