/
CreateBinaryTreeFromInorderPreorderTest.java
102 lines (83 loc) · 3.43 KB
/
CreateBinaryTreeFromInorderPreorderTest.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
package com.thealgorithms.datastructures.trees;
import java.util.Arrays;
import org.junit.jupiter.api.Assertions;
import org.junit.jupiter.api.Test;
/**
* @author Albina Gimaletdinova on 14/05/2023
*/
public class CreateBinaryTreeFromInorderPreorderTest {
@Test
public void testOnNullArraysShouldReturnNullTree() {
// when
BinaryTree.Node root = CreateBinaryTreeFromInorderPreorder.createTree(null, null);
BinaryTree.Node rootOpt = CreateBinaryTreeFromInorderPreorder.createTreeOptimized(null, null);
// then
Assertions.assertNull(root);
Assertions.assertNull(rootOpt);
}
@Test
public void testOnEmptyArraysShouldCreateNullTree() {
// given
Integer[] preorder = {};
Integer[] inorder = {};
// when
BinaryTree.Node root = CreateBinaryTreeFromInorderPreorder.createTree(preorder, inorder);
BinaryTree.Node rootOpt = CreateBinaryTreeFromInorderPreorder.createTreeOptimized(preorder, inorder);
// then
Assertions.assertNull(root);
Assertions.assertNull(rootOpt);
}
@Test
public void testOnSingleNodeTreeShouldCreateCorrectTree() {
// given
Integer[] preorder = {1};
Integer[] inorder = {1};
// when
BinaryTree.Node root = CreateBinaryTreeFromInorderPreorder.createTree(preorder, inorder);
BinaryTree.Node rootOpt = CreateBinaryTreeFromInorderPreorder.createTreeOptimized(preorder, inorder);
// then
checkTree(preorder, inorder, root);
checkTree(preorder, inorder, rootOpt);
}
@Test
public void testOnRightSkewedTreeShouldCreateCorrectTree() {
// given
Integer[] preorder = {1, 2, 3, 4};
Integer[] inorder = {1, 2, 3, 4};
// when
BinaryTree.Node root = CreateBinaryTreeFromInorderPreorder.createTree(preorder, inorder);
BinaryTree.Node rootOpt = CreateBinaryTreeFromInorderPreorder.createTreeOptimized(preorder, inorder);
// then
checkTree(preorder, inorder, root);
checkTree(preorder, inorder, rootOpt);
}
@Test
public void testOnLeftSkewedTreeShouldCreateCorrectTree() {
// given
Integer[] preorder = {1, 2, 3, 4};
Integer[] inorder = {4, 3, 2, 1};
// when
BinaryTree.Node root = CreateBinaryTreeFromInorderPreorder.createTree(preorder, inorder);
BinaryTree.Node rootOpt = CreateBinaryTreeFromInorderPreorder.createTreeOptimized(preorder, inorder);
// then
checkTree(preorder, inorder, root);
checkTree(preorder, inorder, rootOpt);
}
@Test
public void testOnNormalTreeShouldCreateCorrectTree() {
// given
Integer[] preorder = {3, 9, 20, 15, 7};
Integer[] inorder = {9, 3, 15, 20, 7};
// when
BinaryTree.Node root = CreateBinaryTreeFromInorderPreorder.createTree(preorder, inorder);
BinaryTree.Node rootOpt = CreateBinaryTreeFromInorderPreorder.createTreeOptimized(preorder, inorder);
// then
checkTree(preorder, inorder, root);
checkTree(preorder, inorder, rootOpt);
}
private static void checkTree(Integer[] preorder, Integer[] inorder, BinaryTree.Node root) {
Assertions.assertNotNull(root);
Assertions.assertEquals(PreOrderTraversal.iterativePreOrder(root), Arrays.asList(preorder));
Assertions.assertEquals(InorderTraversal.iterativeInorder(root), Arrays.asList(inorder));
}
}