algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-27 22:43:30 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add boundary traversal of binary tree (#5639)

Browse Source
This commit is contained in:
xuyang471
2024-10-10 03:50:30 +08:00
committed by GitHub
parent f170078b8b
commit 48c65e4c5e
2 changed files with 276 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

108
src/test/java/com/thealgorithms/datastructures/trees/BoundaryTraversalTest.java Normal file
View File

@ -0,0 +1,108 @@
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;
/**
*
*/
public class BoundaryTraversalTest {
@Test
public void testNullRoot() {
assertEquals(Collections.emptyList(), BoundaryTraversal.boundaryTraversal(null));
assertEquals(Collections.emptyList(), BoundaryTraversal.iterativeBoundaryTraversal(null));
}
@Test
public void testSingleNodeTree() {
final BinaryTree.Node root = new BinaryTree.Node(1);
List<Integer> expected = List.of(1);
assertEquals(expected, BoundaryTraversal.boundaryTraversal(root));
assertEquals(expected, BoundaryTraversal.iterativeBoundaryTraversal(root));
}
/*
1
/ \
2 3
/ \ / \
4 5 6 7
*/
@Test
public void testCompleteBinaryTree() {
final BinaryTree.Node root = TreeTestUtils.createTree(new Integer[] {1, 2, 3, 4, 5, 6, 7});
List<Integer> expected = List.of(1, 2, 4, 5, 6, 7, 3);
assertEquals(expected, BoundaryTraversal.boundaryTraversal(root));
assertEquals(expected, BoundaryTraversal.iterativeBoundaryTraversal(root));
}
/*
1
/ \
2 7
/ \
3 8
\ /
4 9
/ \
5 6
/ \
10 11
*/
@Test
public void testBoundaryTraversal() {
final BinaryTree.Node root = TreeTestUtils.createTree(new Integer[] {1, 2, 7, 3, null, null, 8, null, 4, 9, null, 5, 6, 10, 11});
List<Integer> expected = List.of(1, 2, 3, 4, 5, 6, 10, 11, 9, 8, 7);
assertEquals(expected, BoundaryTraversal.boundaryTraversal(root));
assertEquals(expected, BoundaryTraversal.iterativeBoundaryTraversal(root));
}
/*
1
/
2
/
3
/
4
*/
@Test
public void testLeftSkewedTree() {
final BinaryTree.Node root = TreeTestUtils.createTree(new Integer[] {1, 2, null, 3, null, 4, null});
List<Integer> expected = List.of(1, 2, 3, 4);
assertEquals(expected, BoundaryTraversal.boundaryTraversal(root));
assertEquals(expected, BoundaryTraversal.iterativeBoundaryTraversal(root));
}
/*
5
\
6
\
7
\
8
*/
@Test
public void testRightSkewedTree() {
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, BoundaryTraversal.boundaryTraversal(root));
assertEquals(expected, BoundaryTraversal.iterativeBoundaryTraversal(root));
}
}