1
+ import kotlin.test.Ignore
1
2
import kotlin.test.Test
2
3
import kotlin.test.assertEquals
3
4
import kotlin.test.assertNotNull
@@ -15,6 +16,7 @@ class BinarySearchTreeTest {
15
16
assertEquals(expected, actual)
16
17
}
17
18
19
+ @Ignore
18
20
@Test
19
21
fun `inserts less` () {
20
22
val tree = BinarySearchTree <Char >()
@@ -32,6 +34,7 @@ class BinarySearchTreeTest {
32
34
assertEquals(expectedRoot, actualRoot)
33
35
}
34
36
37
+ @Ignore
35
38
@Test
36
39
fun `inserts same` () {
37
40
val tree = BinarySearchTree <String >()
@@ -49,6 +52,7 @@ class BinarySearchTreeTest {
49
52
assertEquals(expectedRoot, actualRoot)
50
53
}
51
54
55
+ @Ignore
52
56
@Test
53
57
fun `inserts right` () {
54
58
val tree = BinarySearchTree <Int >()
@@ -66,6 +70,7 @@ class BinarySearchTreeTest {
66
70
assertEquals(expectedRoot, actualRoot)
67
71
}
68
72
73
+ @Ignore
69
74
@Test
70
75
fun `creates complex tree` () {
71
76
val tree = BinarySearchTree <Char >()
@@ -76,6 +81,7 @@ class BinarySearchTreeTest {
76
81
assertEquals(expected, actual)
77
82
}
78
83
84
+ @Ignore
79
85
@Test
80
86
fun `sorts single element` () {
81
87
val tree = BinarySearchTree <String >()
@@ -85,6 +91,7 @@ class BinarySearchTreeTest {
85
91
assertEquals(expected, actual)
86
92
}
87
93
94
+ @Ignore
88
95
@Test
89
96
fun `sorts collection of two if second inserted is smaller than first` () {
90
97
val tree = BinarySearchTree <Int >()
@@ -95,6 +102,7 @@ class BinarySearchTreeTest {
95
102
assertEquals(expected, actual)
96
103
}
97
104
105
+ @Ignore
98
106
@Test
99
107
fun `sorts collection of two if second number is same as first` () {
100
108
val tree = BinarySearchTree <Char >()
@@ -105,6 +113,7 @@ class BinarySearchTreeTest {
105
113
assertEquals(expected, actual)
106
114
}
107
115
116
+ @Ignore
108
117
@Test
109
118
fun `sorts collection of two if second inserted is bigger than first` () {
110
119
val tree = BinarySearchTree <Char >()
@@ -115,6 +124,7 @@ class BinarySearchTreeTest {
115
124
assertEquals(expected, actual)
116
125
}
117
126
127
+ @Ignore
118
128
@Test
119
129
fun `iterates over complex tree` () {
120
130
val tree = BinarySearchTree <String >()
@@ -125,6 +135,7 @@ class BinarySearchTreeTest {
125
135
assertEquals(expected, actual)
126
136
}
127
137
138
+ @Ignore
128
139
@Test
129
140
fun `big tree level order` () {
130
141
val tree = BinarySearchTree <Int >()
0 commit comments