-
Notifications
You must be signed in to change notification settings - Fork 19.9k
/
Copy pathTreapTest.java
67 lines (56 loc) · 1.61 KB
/
TreapTest.java
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
package com.thealgorithms.datastructures.trees;
import static org.junit.jupiter.api.Assertions.assertEquals;
import org.junit.jupiter.api.Test;
public class TreapTest {
@Test
void arrayBuild() {
int[] arr = {5, 9, 6, 2, 3, 8, 1};
Treap treap = new Treap(arr);
assertEquals("{1,2,3,5,6,8,9,}", treap.inOrder());
}
@Test
void build() {
Treap treap = new Treap();
treap.insert(4);
treap.insert(5);
treap.insert(9);
treap.insert(2);
assertEquals("{2,4,5,9,}", treap.inOrder());
}
@Test
void delete() {
int[] arr = {5, 9, 6, 2, 3, 8, 1};
Treap treap = new Treap(arr);
treap.delete(5);
assertEquals("{1,2,3,6,8,9,}", treap.inOrder());
}
@Test
void searchAndFound() {
int[] arr = {5, 9, 6, 2, 3, 8, 1};
Treap treap = new Treap(arr);
assertEquals(5, treap.search(5).value());
}
@Test
void searchAndNotFound() {
int[] arr = {5, 9, 6, 2, 3, 8, 1};
Treap treap = new Treap(arr);
assertEquals(null, treap.search(4));
}
@Test
void lowerBound() {
int[] arr = {5, 9, 6, 2, 3, 8, 1};
Treap treap = new Treap(arr);
assertEquals(5, treap.lowerBound(4));
}
@Test upperBound() {
int[] arr = {5, 9, 6, 2, 3, 8, 1};
Treap treap = new Treap(arr);
assertEquals(6, treap.upperBound(5));
}
@Test misc() {
int[] arr = {5, 9, 6, 2, 3, 8, 1};
Treap treap = new Treap(arr);
assertEquals(7, treap.size());
assertEquals(false, treap.isEmpty());
}
}