/
NikolayIvkin
/
TheAlgorithms
Обзор
Документация
Войти
/
NikolayIvkin
/
TheAlgorithms
Код
Запросы
0
Задачи
Вики
Пакеты
0
Релизы
0
Аналитика
Безопасность
master
src/test/java/com/thealgorithms/datastructures/trees/PreOrderTraversalTest.java
52 строки
1 KB
acbin
Add automatic linter (#4214)
09 июн 2023, 15:05
Не верифицирован
09 июн 2023, 15:05
415a04e
Код
Авторство
О чём код?
package com.thealgorithms.datastructures.trees; import static org.junit.jupiter.api.Assertions.assertEquals; import java.util.Collections; import java.util.List; import org.junit.jupiter.api.Test; /** * @author Albina Gimaletdinova on 17/02/2023 */ public class PreOrderTraversalTest { @Test public void testNullRoot() { assertEquals(Collections.emptyList(), PreOrderTraversal.recursivePreOrder(null)); assertEquals(Collections.emptyList(), PreOrderTraversal.iterativePreOrder(null)); } /* 1 / \ 2 3 /\ /\ 4 5 6 7 */ @Test public void testRecursivePreOrder() { final BinaryTree.Node root = TreeTestUtils.createTree(new Integer[] {1, 2, 3, 4, 5, 6, 7}); List<Integer> expected = List.of(1, 2, 4, 5, 3, 6, 7); assertEquals(expected, PreOrderTraversal.recursivePreOrder(root)); assertEquals(expected, PreOrderTraversal.iterativePreOrder(root)); } /* 5 \ 6 \ 7 \ 8 */ @Test public void testRecursivePreOrderNonBalanced() { final BinaryTree.Node root = TreeTestUtils.createTree(new Integer[] {5, null, 6, null, 7, null, 8}); List<Integer> expected = List.of(5, 6, 7, 8); assertEquals(expected, PreOrderTraversal.recursivePreOrder(root)); assertEquals(expected, PreOrderTraversal.iterativePreOrder(root)); } }