algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-28 06:55:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

Added same trees algorithm check with a unit test (#3845)

Browse Source 
Co-authored-by: Debasish Biswas <debasishbsws.abc@gmail.com>
This commit is contained in:
Albina Gimaletdinova
2023-01-13 23:07:56 +03:00
committed by GitHub
parent 44c05bf7db
commit 351e85d264
2 changed files with 153 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

71
src/test/java/com/thealgorithms/datastructures/trees/SameTreesCheckTest.java Normal file
View File

@ -0,0 +1,71 @@
package com.thealgorithms.datastructures.trees;
import org.junit.jupiter.api.Test;
import static org.junit.jupiter.api.Assertions.assertFalse;
import static org.junit.jupiter.api.Assertions.assertTrue;
/**
* @author Albina Gimaletdinova on 12/01/2023
*/
public class SameTreesCheckTest {
@Test
public void testBothRootsAreNull() {
assertTrue(SameTreesCheck.check(null, null));
}
@Test
public void testOneRootIsNull() {
final BinaryTree.Node root = TreeTestUtils.createTree(new Integer[]{100});
assertFalse(SameTreesCheck.check(root, null));
}
@Test
public void testSingleNodeTreesAreSame() {
final BinaryTree.Node p = TreeTestUtils.createTree(new Integer[]{100});
final BinaryTree.Node q = TreeTestUtils.createTree(new Integer[]{100});
assertTrue(SameTreesCheck.check(p, q));
}
/*
1 1
/ \ / \
2 3 2 3
/\ /\ /\ /\
4 5 6 7 4 5 6 7
*/
@Test
public void testSameTreesIsSuccessful() {
final BinaryTree.Node p = TreeTestUtils.createTree(new Integer[]{1, 2, 3, 4, 5, 6, 7});
final BinaryTree.Node q = TreeTestUtils.createTree(new Integer[]{1, 2, 3, 4, 5, 6, 7});
assertTrue(SameTreesCheck.check(p, q));
}
/*
1 1
/ \ / \
2 3 2 3
/\ /\ /\ /
4 5 6 7 4 5 6
*/
@Test
public void testSameTreesFails() {
final BinaryTree.Node p = TreeTestUtils.createTree(new Integer[]{1, 2, 3, 4, 5, 6, 7});
final BinaryTree.Node q = TreeTestUtils.createTree(new Integer[]{1, 2, 3, 4, 5, 6});
assertFalse(SameTreesCheck.check(p, q));
}
/*
1 1
/ \
2 2
*/
@Test
public void testTreesWithDifferentStructure() {
final BinaryTree.Node p = TreeTestUtils.createTree(new Integer[]{1, 2});
final BinaryTree.Node q = TreeTestUtils.createTree(new Integer[]{1, null, 2});
assertFalse(SameTreesCheck.check(p, q));
}
}