forked from fishercoder1534/Leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path_105Test.java
More file actions
41 lines (35 loc) · 1.11 KB
/
_105Test.java
File metadata and controls
41 lines (35 loc) · 1.11 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
package com.fishercoder;
import com.fishercoder.common.classes.TreeNode;
import com.fishercoder.common.utils.TreeUtils;
import com.fishercoder.solutions._105;
import java.util.Arrays;
import org.junit.BeforeClass;
import org.junit.Test;
import static junit.framework.Assert.assertEquals;
public class _105Test {
private static _105.Solution1 solution1;
private static TreeNode expected;
private static TreeNode actual;
private static int[] preorder;
private static int[] inorder;
@BeforeClass
public static void setup() {
solution1 = new _105.Solution1();
}
@Test
public void test1() {
preorder = new int[] {1, 2, 3};
inorder = new int[] {2, 1, 3};
actual = solution1.buildTree(preorder, inorder);
expected = TreeUtils.constructBinaryTree(Arrays.asList(1, 2, 3));
assertEquals(expected, actual);
}
@Test
public void test2() {
preorder = new int[] {1, 2, 4, 5, 3};
inorder = new int[] {4, 2, 5, 1, 3};
actual = solution1.buildTree(preorder, inorder);
expected = TreeUtils.constructBinaryTree(Arrays.asList(1, 2, 3, 4, 5));
assertEquals(expected, actual);
}
}