navid-zhaw/ADS-Praktika
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

fixed testInterval

Browse Source
This commit is contained in:
navid.sassan 2020-10-25 22:35:52 +01:00
parent 473c333cfd
commit 15dce99c64
2 changed files with 15 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
05/src/main/java/ch/zhaw/ads/Traversal.java
View File

@ -10,4 +10,5 @@ public interface Traversal<T> {
public void postorder(Visitor<T> vistor);
/* traverse elements of tree in levelorder */
public void levelorder(Visitor<T> vistor);
public void interval(Comparable<T> min, Comparable<T> max, Visitor<T> v);
}

20
05/src/test/java/ch/zhaw/ads/TreeTest.java
View File

@ -46,7 +46,8 @@ public class TreeTest {
@Test
public void testInterval() {
Comparable<Integer> myComparator = new MyComparator();
Comparable<Integer> minComparable = new MyComparable(1);
Comparable<Integer> maxComparable = new MyComparable(9);
Visitor<Integer> v = new MyVisitor<Integer>();
Tree<Integer> mytree = new SortedBinaryTree<Integer>();
mytree.add(10);
@ -58,16 +59,21 @@ public class TreeTest {
mytree.add(8);
mytree.add(4);
tree.traversal().interval(myComparator, myComparator, v);
System.out.println(v.toString());
// assertEquals("levelorder", "BACD", v.toString());
mytree.traversal().interval(minComparable, maxComparable, v);
assertEquals("interval", "7648", v.toString());
}
}
class MyComparable implements Comparable<Integer> {
Integer value;
public MyComparable(Integer value) {
this.value = value;
}
class MyComparator implements Comparable<Integer> {
public int compare(TreeNode o1, TreeNode o2) {
return o1.element.compareTo(o1.element);
@Override
public int compareTo(Integer other) {
return this.value.compareTo(other);
}
}