Java/src/test/java/com/examplehub/leetcode/easy/MaximumDepthOfBinaryTreeTest.java at patch-1 · letscode-17/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
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 MaximumDepthOfBinaryTreeTest {
  @Test
  void testSolution1() {
    TreeNode root = BinaryTreeUtils.createTree(new int[] {3, 9, 20, -1, -1, 15, 7}, 0);
    assertEquals(3, MaximumDepthOfBinaryTree.solution1(root));

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

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

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

  @Test
  void testSolution2() {
    TreeNode root = BinaryTreeUtils.createTree(new int[] {3, 9, 20, -1, -1, 15, 7}, 0);
    assertEquals(3, MaximumDepthOfBinaryTree.solution2(root));

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