@Test
public void tree_del_2_12() {
int[] keys1 = {0, 2, 4, 6, 8, 1, 3, 5, 7, 9};
int[] keys2 = {0, 9, 2, 7, 4, 5, 6, 3, 8, 1};
RangeIndex rIndex = makeRangeIndex(2);
testInsertDelete(rIndex, keys1, keys2);
}
@Test
public void tree_del_2_10() {
int[] keys1 = {0, 2, 4, 6, 8, 1, 3, 5, 7, 9};
int[] keys2 = {9, 8, 7, 6, 5, 4, 3, 2, 1, 0};
RangeIndex rIndex = makeRangeIndex(2);
testInsertDelete(rIndex, keys1, keys2);
}
@Test
public void tree_del_2_01() {
int[] keys1 = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
int[] keys2 = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
RangeIndex rIndex = makeRangeIndex(2);
testInsertDelete(rIndex, keys1, keys2);
}
@Test
public void tree_del_2_08() {
int[] keys1 = {9, 8, 7, 6, 5, 4, 3, 2, 1, 0};
int[] keys2 = {0, 9, 2, 7, 4, 5, 6, 3, 8, 1};
RangeIndex rIndex = makeRangeIndex(2);
testInsertDelete(rIndex, keys1, keys2);
}
@Test
public void tree_del_0_3() {
int[] keys1 = {0, 1, 2};
int[] keys2 = {1, 0, 2};
RangeIndex rIndex = makeRangeIndex(2);
testInsertDelete(rIndex, keys1, keys2);
}