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

Vertical order traversal refactoring, added unit test (#3844)

Browse Source 
Vertical order traversal refactoring, added test
This commit is contained in:
Albina Gimaletdinova
2023-01-13 16:56:15 +03:00
committed by GitHub
parent 5aa417b6ae
commit 3b6e3edbfb
2 changed files with 64 additions and 23 deletions
Download Patch File Download Diff File Expand all files Collapse all files

53
src/test/java/com/thealgorithms/datastructures/trees/VerticalOrderTraversalTest.java Normal file
View File

@ -0,0 +1,53 @@
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 13/01/2023
*/
public class VerticalOrderTraversalTest {
@Test
public void testRootNull() {
assertEquals(Collections.emptyList(), VerticalOrderTraversal.verticalTraversal(null));
}
@Test
public void testSingleNodeTree() {
final BinaryTree.Node root = TreeTestUtils.createTree(new Integer[]{50});
assertEquals(List.of(50), VerticalOrderTraversal.verticalTraversal(root));
}
/*
1
/ \
2 3
/\ /\
4 5 6 7
*/
@Test
public void testVerticalTraversalCompleteTree() {
final BinaryTree.Node root = TreeTestUtils.createTree(new Integer[]{1, 2, 3, 4, 5, 6, 7});
assertEquals(List.of(4, 2, 1, 5, 6, 3, 7), VerticalOrderTraversal.verticalTraversal(root));
}
/*
1
/ \
2 3
/\ /\
4 56 7
/ \
8 9
*/
@Test
public void testVerticalTraversalDifferentHeight() {
final BinaryTree.Node root = TreeTestUtils.createTree(
new Integer[]{1, 2, 3, 4, 5, 6, 7, null, null, 8, null, null, 9});
assertEquals(List.of(4, 2, 8, 1, 5, 6, 3, 9, 7), VerticalOrderTraversal.verticalTraversal(root));
}
}