Java/src/test/java/com/thealgorithms/datastructures/trees/SameTreesCheckTest.java at master · TheAlgorithms/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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
packagecom.thealgorithms.datastructures.trees;

importstaticorg.junit.jupiter.api.Assertions.assertFalse;
importstaticorg.junit.jupiter.api.Assertions.assertTrue;

importorg.junit.jupiter.api.Test;

/**
 * @author Albina Gimaletdinova on 12/01/2023
 */
publicclassSameTreesCheckTest {
@Test
publicvoidtestBothRootsAreNull() {
assertTrue(SameTreesCheck.check(null, null));
 }

@Test
publicvoidtestOneRootIsNull() {
finalBinaryTree.Noderoot = TreeTestUtils.createTree(newInteger[] {100});
assertFalse(SameTreesCheck.check(root, null));
 }

@Test
publicvoidtestSingleNodeTreesAreSame() {
finalBinaryTree.Nodep = TreeTestUtils.createTree(newInteger[] {100});
finalBinaryTree.Nodeq = TreeTestUtils.createTree(newInteger[] {100});
assertTrue(SameTreesCheck.check(p, q));
 }

/*
 1 1
 / \ / \
 2 3 2 3
 /\ /\ /\ /\
 4 5 6 7 4 5 6 7
 */
@Test
publicvoidtestSameTreesIsSuccessful() {
finalBinaryTree.Nodep = TreeTestUtils.createTree(newInteger[] {1, 2, 3, 4, 5, 6, 7});
finalBinaryTree.Nodeq = TreeTestUtils.createTree(newInteger[] {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
publicvoidtestSameTreesFails() {
finalBinaryTree.Nodep = TreeTestUtils.createTree(newInteger[] {1, 2, 3, 4, 5, 6, 7});
finalBinaryTree.Nodeq = TreeTestUtils.createTree(newInteger[] {1, 2, 3, 4, 5, 6});
assertFalse(SameTreesCheck.check(p, q));
 }

/*
 1 1
 / \
 2 2
 */
@Test
publicvoidtestTreesWithDifferentStructure() {
finalBinaryTree.Nodep = TreeTestUtils.createTree(newInteger[] {1, 2});
finalBinaryTree.Nodeq = TreeTestUtils.createTree(newInteger[] {1, null, 2});
assertFalse(SameTreesCheck.check(p, q));
 }
}