package com.fishercoder;

import com.fishercoder.common.classes.ListNode;
import com.fishercoder.common.classes.TreeNode;
import com.fishercoder.common.utils.LinkedListUtils;
import com.fishercoder.common.utils.TreeUtils;
import com.fishercoder.solutions._1367;
import org.junit.BeforeClass;
import org.junit.Test;

import java.util.Arrays;

import static org.junit.Assert.assertEquals;

public class _1367Test {
    private static _1367.Solution1 solution1;

    @Test
    public void test1() {
        solution1 = new _1367.Solution1();
        ListNode head = LinkedListUtils.contructLinkedList(new int[]{4, 2, 8});
        TreeNode root = TreeUtils.constructBinaryTree(Arrays.asList(1, 4, 4, null, 2, 2, null, 1, null, 6, 8, null, null, null, null, 1, 3));
        assertEquals(true, solution1.isSubPath(head, root));
    }

    @Test
    public void test2() {
        solution1 = new _1367.Solution1();
        ListNode head = LinkedListUtils.contructLinkedList(new int[]{1, 4, 2, 6});
        TreeNode root = TreeUtils.constructBinaryTree(Arrays.asList(1, 4, 4, null, 2, 2, null, 1, null, 6, 8, null, null, null, null, 1, 3));
        assertEquals(true, solution1.isSubPath(head, root));
    }

    @Test
    public void test3() {
        solution1 = new _1367.Solution1();
        ListNode head = LinkedListUtils.contructLinkedList(new int[]{1, 4, 2, 6, 8});
        TreeNode root = TreeUtils.constructBinaryTree(Arrays.asList(1, 4, 4, null, 2, 2, null, 1, null, 6, 8, null, null, null, null, 1, 3));
        assertEquals(false, solution1.isSubPath(head, root));
    }

}
@@ -259,38 +259,8 @@
 67;%0A
-import org.junit.BeforeClass;%0A
 impo

refactor 1367