|
@@ -95,7 +95,7 @@ public class BinarySearchTreeTest {
|
95
|
95
|
);
|
96
|
96
|
|
97
|
97
|
List<Character> treeData = Collections.unmodifiableList(
|
98
|
|
- Arrays.asList('4', '2', '6', '1', '3', '7', '5')
|
|
98
|
+ Arrays.asList('4', '2', '6', '1', '3', '5', '7')
|
99
|
99
|
);
|
100
|
100
|
treeData.forEach(binarySearchTree::insert);
|
101
|
101
|
|
|
@@ -108,10 +108,10 @@ public class BinarySearchTreeTest {
|
108
|
108
|
public void sortsSingleElement() {
|
109
|
109
|
BinarySearchTree<String> binarySearchTree = new BinarySearchTree<>();
|
110
|
110
|
List<String> expected = Collections.unmodifiableList(
|
111
|
|
- Collections.singletonList("4")
|
|
111
|
+ Collections.singletonList("2")
|
112
|
112
|
);
|
113
|
113
|
|
114
|
|
- binarySearchTree.insert("4");
|
|
114
|
+ binarySearchTree.insert("2");
|
115
|
115
|
|
116
|
116
|
List<String> actual = binarySearchTree.getAsSortedList();
|
117
|
117
|
assertEquals(expected, actual);
|
|
@@ -122,26 +122,41 @@ public class BinarySearchTreeTest {
|
122
|
122
|
public void sortsCollectionOfTwoIfSecondInsertedIsSmallerThanFirst() {
|
123
|
123
|
BinarySearchTree<Integer> binarySearchTree = new BinarySearchTree<>();
|
124
|
124
|
List<Integer> expected = Collections.unmodifiableList(
|
125
|
|
- Arrays.asList(2, 4)
|
|
125
|
+ Arrays.asList(1, 2)
|
126
|
126
|
);
|
127
|
127
|
|
128
|
|
- binarySearchTree.insert(4);
|
129
|
128
|
binarySearchTree.insert(2);
|
|
129
|
+ binarySearchTree.insert(1);
|
130
|
130
|
|
131
|
131
|
List<Integer> actual = binarySearchTree.getAsSortedList();
|
132
|
132
|
assertEquals(expected, actual);
|
133
|
133
|
}
|
|
134
|
+
|
|
135
|
+ @Ignore("Remove to run test")
|
|
136
|
+ @Test
|
|
137
|
+ public void sortsCollectionOfTwoIfSecondNumberisSameAsFirst() {
|
|
138
|
+ BinarySearchTree<Character> binarySearchTree = new BinarySearchTree<>();
|
|
139
|
+ List<Character> expected = Collections.unmodifiableList(
|
|
140
|
+ Arrays.asList('2', '2')
|
|
141
|
+ );
|
|
142
|
+
|
|
143
|
+ binarySearchTree.insert('2');
|
|
144
|
+ binarySearchTree.insert('2');
|
|
145
|
+
|
|
146
|
+ List<Character> actual = binarySearchTree.getAsSortedList();
|
|
147
|
+ assertEquals(expected, actual);
|
|
148
|
+ }
|
134
|
149
|
|
135
|
150
|
@Ignore("Remove to run test")
|
136
|
151
|
@Test
|
137
|
152
|
public void sortsCollectionOfTwoIfSecondInsertedIsBiggerThanFirst() {
|
138
|
153
|
BinarySearchTree<Character> binarySearchTree = new BinarySearchTree<>();
|
139
|
154
|
List<Character> expected = Collections.unmodifiableList(
|
140
|
|
- Arrays.asList('4', '5')
|
|
155
|
+ Arrays.asList('2', '3')
|
141
|
156
|
);
|
142
|
157
|
|
143
|
|
- binarySearchTree.insert('4');
|
144
|
|
- binarySearchTree.insert('5');
|
|
158
|
+ binarySearchTree.insert('2');
|
|
159
|
+ binarySearchTree.insert('3');
|
145
|
160
|
|
146
|
161
|
List<Character> actual = binarySearchTree.getAsSortedList();
|
147
|
162
|
assertEquals(expected, actual);
|
|
@@ -152,11 +167,11 @@ public class BinarySearchTreeTest {
|
152
|
167
|
public void iteratesOverComplexTree() {
|
153
|
168
|
BinarySearchTree<String> binarySearchTree = new BinarySearchTree<>();
|
154
|
169
|
List<String> expected = Collections.unmodifiableList(
|
155
|
|
- Arrays.asList("1", "2", "3", "4", "5", "6", "7")
|
|
170
|
+ Arrays.asList("1", "2", "3", "5", "6", "7")
|
156
|
171
|
);
|
157
|
172
|
|
158
|
173
|
List<String> treeData = Collections.unmodifiableList(
|
159
|
|
- Arrays.asList("4", "2", "1", "3", "6", "7", "5")
|
|
174
|
+ Arrays.asList("2", "1", "3", "6", "7", "5")
|
160
|
175
|
);
|
161
|
176
|
treeData.forEach(binarySearchTree::insert);
|
162
|
177
|
|