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 inorder binary tree traversal (#3898)

Browse Source
This commit is contained in:
Albina Gimaletdinova
2023-02-25 23:58:06 +03:00
committed by GitHub
parent 6d13d95e41
commit 45923d6872
3 changed files with 121 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

53
src/test/java/com/thealgorithms/datastructures/trees/InorderTraversalTest.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 21/02/2023
*/
public class InorderTraversalTest {
@Test
public void testNullRoot() {
assertEquals(Collections.emptyList(), InorderTraversal.recursiveInorder(null));
assertEquals(Collections.emptyList(), InorderTraversal.iterativeInorder(null));
}
/*
1
/ \
2 3
/\ /\
4 5 6 7
*/
@Test
public void testRecursiveInorder() {
final BinaryTree.Node root = TreeTestUtils.createTree(new Integer[]{1, 2, 3, 4, 5, 6, 7});
List<Integer> expected = List.of(4, 2, 5, 1, 6, 3, 7);
assertEquals(expected, InorderTraversal.recursiveInorder(root));
assertEquals(expected, InorderTraversal.iterativeInorder(root));
}
/*
5
\
6
\
7
\
8
*/
@Test
public void testRecursiveInorderNonBalanced() {
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, InorderTraversal.recursiveInorder(root));
assertEquals(expected, InorderTraversal.iterativeInorder(root));
}
}

12
src/test/java/com/thealgorithms/datastructures/trees/PreOrderTraversalTest.java
View File

@ -27,8 +27,10 @@ public class PreOrderTraversalTest {
@Test
public void testRecursivePreOrder() {
final BinaryTree.Node root = TreeTestUtils.createTree(new Integer[]{1, 2, 3, 4, 5, 6, 7});
assertEquals(List.of(1, 2, 4, 5, 3, 6, 7), PreOrderTraversal.recursivePreOrder(root));
assertEquals(List.of(1, 2, 4, 5, 3, 6, 7), PreOrderTraversal.iterativePreOrder(root));
List<Integer> expected = List.of(1, 2, 4, 5, 3, 6, 7);
assertEquals(expected, PreOrderTraversal.recursivePreOrder(root));
assertEquals(expected, PreOrderTraversal.iterativePreOrder(root));
}
/*
@ -43,7 +45,9 @@ public class PreOrderTraversalTest {
@Test
public void testRecursivePreOrderNonBalanced() {
final BinaryTree.Node root = TreeTestUtils.createTree(new Integer[]{5, null, 6, null, 7, null, 8});
assertEquals(List.of(5, 6, 7, 8), PreOrderTraversal.recursivePreOrder(root));
assertEquals(List.of(5, 6, 7, 8), PreOrderTraversal.iterativePreOrder(root));
List<Integer> expected = List.of(5, 6, 7, 8);
assertEquals(expected, PreOrderTraversal.recursivePreOrder(root));
assertEquals(expected, PreOrderTraversal.iterativePreOrder(root));
}
}