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

Refactor Level Order Traversal (#3869)

Browse Source
This commit is contained in:
Albina Gimaletdinova
2023-02-14 13:33:14 +03:00
committed by GitHub
parent c0fec8dfe2
commit a584ca248c
7 changed files with 154 additions and 98 deletions
Download Patch File Download Diff File Expand all files Collapse all files

54
src/test/java/com/thealgorithms/datastructures/trees/LevelOrderTraversalTest.java Normal file
View File

@ -0,0 +1,54 @@
package com.thealgorithms.datastructures.trees;
import org.junit.jupiter.api.Test;
import java.util.Collections;
import java.util.List;
import static org.junit.jupiter.api.Assertions.assertEquals;
/**
* @author Albina Gimaletdinova on 08/02/2023
*/
public class LevelOrderTraversalTest {
@Test
public void testRootNull() {
assertEquals(Collections.emptyList(), LevelOrderTraversal.traverse(null));
}
@Test
public void testSingleNodeTree() {
final BinaryTree.Node root = TreeTestUtils.createTree(new Integer[]{50});
assertEquals(List.of(List.of(50)), LevelOrderTraversal.traverse(root));
}
/*
1
/ \
2 3
/\ /\
4 5 6 7
*/
@Test
public void testLevelOrderTraversalCompleteTree() {
final BinaryTree.Node root = TreeTestUtils.createTree(new Integer[]{1, 2, 3, 4, 5, 6, 7});
assertEquals(List.of(List.of(1), List.of(2, 3), List.of(4, 5, 6, 7)), LevelOrderTraversal.traverse(root));
}
/*
1
/ \
2 3
/\ /\
4 5 6 7
/ \
8 9
*/
@Test
public void testLevelOrderTraversalDifferentHeight() {
final BinaryTree.Node root = TreeTestUtils.createTree(
new Integer[]{1, 2, 3, 4, 5, 6, 7, null, null, 8, null, null, 9});
assertEquals(List.of(List.of(1), List.of(2, 3), List.of(4, 5, 6, 7), List.of(8, 9)),
LevelOrderTraversal.traverse(root));
}
}

2
src/test/java/com/thealgorithms/datastructures/trees/VerticalOrderTraversalTest.java
View File

@ -40,7 +40,7 @@ public class VerticalOrderTraversalTest {
/ \
2 3
/\ /\
4 56 7
4 5 6 7
/ \
8 9
*/

30
src/test/java/com/thealgorithms/datastructures/trees/ZigzagTraversalTest.java
View File

@ -22,9 +22,33 @@ public class ZigzagTraversalTest {
assertEquals(List.of(List.of(50)), ZigzagTraversal.traverse(root));
}
/*
1
/ \
2 3
/\ /\
4 5 6 7
*/
@Test
public void testZigzagTraversal() {
final BinaryTree.Node root = TreeTestUtils.createTree(new Integer[]{7, 6, 14, 2, 80, 100});
assertEquals(List.of(List.of(7), List.of(14, 6), List.of(2, 80, 100)), ZigzagTraversal.traverse(root));
public void testZigzagTraversalCompleteTree() {
final BinaryTree.Node root = TreeTestUtils.createTree(new Integer[]{1, 2, 3, 4, 5, 6, 7});
assertEquals(List.of(List.of(1), List.of(3, 2), List.of(4, 5, 6, 7)), ZigzagTraversal.traverse(root));
}
/*
1
/ \
2 3
/\ /\
4 5 6 7
/ \
8 9
*/
@Test
public void testZigzagTraversalDifferentHeight() {
final BinaryTree.Node root = TreeTestUtils.createTree(
new Integer[]{1, 2, 3, 4, 5, 6, 7, null, null, 8, null, null, 9});
assertEquals(List.of(List.of(1), List.of(3, 2), List.of(4, 5, 6, 7), List.of(9, 8)),
ZigzagTraversal.traverse(root));
}
}