Java/src/test/java/com/examplehub/leetcode/easy/BinaryTreeInorderTraversalTest.java at master · pearl-coder/Java · GitHub

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
42
43
44
45
package com.examplehub.leetcode.easy;

import static org.junit.jupiter.api.Assertions.*;

import com.examplehub.leetcode.TreeNode;
import com.examplehub.leetcode.utils.BinaryTreeUtils;
import org.junit.jupiter.api.Test;

class BinaryTreeInorderTraversalTest {
  @Test
  void testSolution1() {
    TreeNode root = BinaryTreeUtils.createTree(new int[] {1, -1, 2, -1, -1, 3}, 0);
    assertEquals("[1, 3, 2]", BinaryTreeInorderTraversal.solution1(root).toString());

    root = BinaryTreeUtils.createTree(new int[] {}, 0);
    assertEquals("[]", BinaryTreeInorderTraversal.solution1(root).toString());

    root = BinaryTreeUtils.createTree(new int[] {1}, 0);
    assertEquals("[1]", BinaryTreeInorderTraversal.solution1(root).toString());

    root = BinaryTreeUtils.createTree(new int[] {1, 2}, 0);
    assertEquals("[2, 1]", BinaryTreeInorderTraversal.solution1(root).toString());

    root = BinaryTreeUtils.createTree(new int[] {1, -1, 2}, 0);
    assertEquals("[1, 2]", BinaryTreeInorderTraversal.solution1(root).toString());
  }

  @Test
  void testSolution2() {
    TreeNode root = BinaryTreeUtils.createTree(new int[] {1, -1, 2, -1, -1, 3}, 0);
    assertEquals("[1, 3, 2]", BinaryTreeInorderTraversal.solution2(root).toString());

    root = BinaryTreeUtils.createTree(new int[] {}, 0);
    assertEquals("[]", BinaryTreeInorderTraversal.solution2(root).toString());

    root = BinaryTreeUtils.createTree(new int[] {1}, 0);
    assertEquals("[1]", BinaryTreeInorderTraversal.solution2(root).toString());

    root = BinaryTreeUtils.createTree(new int[] {1, 2}, 0);
    assertEquals("[2, 1]", BinaryTreeInorderTraversal.solution2(root).toString());

    root = BinaryTreeUtils.createTree(new int[] {1, -1, 2}, 0);
    assertEquals("[1, 2]", BinaryTreeInorderTraversal.solution2(root).toString());
  }
}