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
|
import org.junit.jupiter.api.Test;
import static org.junit.jupiter.api.Assertions.*;
class TreeBstCheckTest {
@Test
void test() {
TreeBstCheck.TreeOrders tt = new TreeBstCheck.TreeOrders();
tt.key = new int[]{2, 1, 3};
tt.left = new int[]{1, -1, -1};
tt.right = new int[]{2, -1, -1};
assertTrue(tt.isBst());
}
@Test
void test1() {
TreeBstCheck.TreeOrders tt = new TreeBstCheck.TreeOrders();
tt.key = new int[]{1, 2, 3};
tt.left = new int[]{1, -1, -1};
tt.right = new int[]{2, -1, -1};
assertFalse(tt.isBst());
}
@Test
void test2() {
TreeBstCheck.TreeOrders tt = new TreeBstCheck.TreeOrders();
tt.key = new int[0];
tt.left = new int[0];
tt.right = new int[0];
assertTrue(tt.isBst());
}
@Test
void test3() {
TreeBstCheck.TreeOrders tt = new TreeBstCheck.TreeOrders();
tt.key = new int[]{1, 2, 3, 4, 5};
tt.left = new int[]{-1, -1, -1, -1, -1};
tt.right = new int[]{1, 2, 3, 4, -1};
assertTrue(tt.isBst());
}
@Test
void test4() {
TreeBstCheck.TreeOrders tt = new TreeBstCheck.TreeOrders();
tt.key = new int[]{4, 2, 6, 1, 3, 5, 7};
tt.left = new int[]{1, 3, 5, -1, -1, -1, -1};
tt.right = new int[]{2, 4, 6, -1, -1, -1, -1};
assertTrue(tt.isBst());
}
@Test
void test5() {
TreeBstCheck.TreeOrders tt = new TreeBstCheck.TreeOrders();
tt.key = new int[]{4, 2, 1, 5};
tt.left = new int[]{1, 2, -1, -1};
tt.right = new int[]{-1, 3, -1, -1};
assertFalse(tt.isBst());
}
@Test
void test6() {
TreeBstCheck.TreeOrders tt = new TreeBstCheck.TreeOrders();
tt.key = new int[]{2, 1, 2};
tt.left = new int[]{1, -1, -1};
tt.right = new int[]{2, -1, -1};
assertTrue(tt.isBst());
}
@Test
void test7() {
TreeBstCheck.TreeOrders tt = new TreeBstCheck.TreeOrders();
tt.key = new int[]{2, 2, 3};
tt.left = new int[]{1, -1, -1};
tt.right = new int[]{2, -1, -1};
assertFalse(tt.isBst());
}
@Test
void test8() {
TreeBstCheck.TreeOrders tt = new TreeBstCheck.TreeOrders();
tt.key = new int[]{2147483647};
tt.left = new int[]{-1};
tt.right = new int[]{-1};
assertTrue(tt.isBst());
}
}
|
