Improved task 572.

Author: javadev

src/main/java/g0501_0600/s0572_subtree_of_another_tree/Solution.java

@@ -5,7 +5,7 @@
 import com_github_leetcode.TreeNode;
 
 public class Solution {
- public boolean isSubtreeFound(TreeNode root, TreeNode subRoot) {
+ private boolean isSubtreeFound(TreeNode root, TreeNode subRoot) {
  if (root == null && subRoot == null) {
  return true;
  }

src/test/java/g0501_0600/s0572_subtree_of_another_tree/SolutionTest.java

@@ -5,25 +5,23 @@
 
 import com_github_leetcode.TreeNode;
 import com_github_leetcode.TreeUtils;
-import java.util.ArrayList;
 import java.util.Arrays;
 import org.junit.jupiter.api.Test;
 
 class SolutionTest {
  @Test
- void isSubtreeFound() {
- TreeNode treeNode =
- TreeUtils.constructBinaryTree(new ArrayList<>(Arrays.asList(3, 4, 5, 1, 2)));
- TreeNode subTree = TreeUtils.constructBinaryTree(new ArrayList<>(Arrays.asList(4, 1, 2)));
- assertThat(new Solution().isSubtreeFound(treeNode, subTree), equalTo(false));
+ void isSubtree() {
+ TreeNode treeNode = TreeUtils.constructBinaryTree(Arrays.asList(3, 4, 5, 1, 2));
+ TreeNode subTree = TreeUtils.constructBinaryTree(Arrays.asList(4, 1, 2));
+ assertThat(new Solution().isSubtree(treeNode, subTree), equalTo(true));
  }
 
  @Test
- void isSubtreeFound2() {
+ void isSubtree2() {
  TreeNode treeNode =
  TreeUtils.constructBinaryTree(
- new ArrayList<>(Arrays.asList(3, 4, 5, 1, 2, null, null, null, null, 0)));
- TreeNode subTree = TreeUtils.constructBinaryTree(new ArrayList<>(Arrays.asList(4, 1, 2)));
- assertThat(new Solution().isSubtreeFound(treeNode, subTree), equalTo(false));
+ Arrays.asList(3, 4, 5, 1, 2, null, null, null, null, 0));
+ TreeNode subTree = TreeUtils.constructBinaryTree(Arrays.asList(4, 1, 2));
+ assertThat(new Solution().isSubtree(treeNode, subTree), equalTo(false));
  }
 }