-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBaseTest.java
More file actions
87 lines (73 loc) · 2.55 KB
/
Copy pathBaseTest.java
File metadata and controls
87 lines (73 loc) · 2.55 KB
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
package tree;
import org.junit.Assert;
import org.junit.Test;
import tree.base.*;
public class BaseTest {
@Test
public void createTest() {
TreeNode tree = CreateTree.create(new int[]{1, 2, 3, 4, 5, 6, 7, 8, 9});
tree.print();
}
@Test
public void createBtTest() {
TreeNode binaryTree = CreateTree.createBinaryTree(new int[]{5, 3, 7, 2, 4, 6, 8, 1, 9});
binaryTree.print();
}
@Test
public void highTest() {
TreeNode tree1 = CreateTree.createBinaryTree(new int[]{5});
Assert.assertEquals(HighOfTree.getHigh(tree1), 1);
TreeNode tree2 = CreateTree.create(new int[]{5, 1, 2});
Assert.assertEquals(HighOfTree.getHigh(tree2), 2);
TreeNode tree3 = CreateTree.create(new int[]{5, 1, 2, 3});
Assert.assertEquals(HighOfTree.getHigh(tree3), 3);
}
@Test
public void countTest() {
TreeNode tree1 = CreateTree.createBinaryTree(new int[]{5});
Assert.assertEquals(CountNode.count(tree1), 1);
TreeNode tree2 = CreateTree.create(new int[]{5, 1, 2});
Assert.assertEquals(CountNode.count(tree2), 3);
TreeNode tree3 = CreateTree.create(new int[]{5, 1, 2, 3});
Assert.assertEquals(CountNode.count(tree3), 4);
}
/**
* 先序
*/
@Test
public void IterativePreorderTraversalTest() {
TreeNode tree = CreateTree.create(new int[]{1, 2, 3, 4, 5, 6, 7, 8, 9});
IterativePreorderTraversal.print(tree);
System.out.println();
IterativePreorderTraversal.print2(tree);
}
/**
* 顺序
*/
@Test
public void IterativeInorderTraversalTest() {
TreeNode tree = CreateTree.createBinaryTree(new int[]{5, 3, 7, 2, 4, 6, 8, 1, 9});
tree.print();
System.out.println();
IterativeInorderTraversal.print(tree);
System.out.println();
IterativeInorderTraversal.print2(tree);
}
/**
* 后序
*/
@Test
public void IterativePostorderTraversalTest() {
TreeNode tree = CreateTree.create(new int[]{5, 4, 6, 2, 3, 7, 8, 1, 9});
IterativePostorderTraversal.print(tree);
}
@Test
public void IsBSTreeTest() {
TreeNode binaryTree = CreateTree.createBinaryTree(new int[]{5, 3, 7, 2, 4, 6, 8, 1, 9});
boolean isBSTree = IsBSTree.check(binaryTree);
Assert.assertEquals(isBSTree, true);
TreeNode binaryTree2 = CreateTree.create(new int[]{5, 3, 7, 2, 4, 6, 8, 1, 9});
boolean isBSTree2 = IsBSTree.check(binaryTree2);
Assert.assertEquals(isBSTree2, false);
}
}