/
NikolayIvkin
/
TheAlgorithms
Обзор
Документация
Войти
/
NikolayIvkin
/
TheAlgorithms
Код
Запросы
0
Задачи
Вики
Пакеты
0
Релизы
0
Аналитика
Безопасность
master
src/test/java/com/thealgorithms/datastructures/trees/SameTreesCheckTest.java
69 строк
2 KB
acbin
style: format code (#4212)
09 июн 2023, 13:52
Не верифицирован
09 июн 2023, 13:52
00282ef
Код
Авторство
О чём код?
package com.thealgorithms.datastructures.trees; import static org.junit.jupiter.api.Assertions.assertFalse; import static org.junit.jupiter.api.Assertions.assertTrue; import org.junit.jupiter.api.Test; /** * @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)); } }