From 473c333cfd4e9ea442b25baeb2c1598c5e244e17 Mon Sep 17 00:00:00 2001
From: "navid.sassan" <navid.sassan@linuxfabrik.ch>
Date: Sun, 25 Oct 2020 22:16:34 +0100
Subject: [PATCH] attempt to write test for s05 ex4

---
 05/src/test/java/ch/zhaw/ads/TreeTest.java | 26 ++++++++++++++++++++++
 1 file changed, 26 insertions(+)

diff --git a/05/src/test/java/ch/zhaw/ads/TreeTest.java b/05/src/test/java/ch/zhaw/ads/TreeTest.java
index a912deb..0046b07 100644
--- a/05/src/test/java/ch/zhaw/ads/TreeTest.java
+++ b/05/src/test/java/ch/zhaw/ads/TreeTest.java
@@ -43,6 +43,32 @@ public class TreeTest {
         tree.traversal().levelorder(v);
         assertEquals("levelorder", "BACD", v.toString());
     }
+
+    @Test
+    public void testInterval() {
+        Comparable<Integer> myComparator = new MyComparator();
+        Visitor<Integer> v = new MyVisitor<Integer>();
+        Tree<Integer> mytree = new SortedBinaryTree<Integer>();
+        mytree.add(10);
+        mytree.add(7);
+        mytree.add(14);
+        mytree.add(17);
+        mytree.add(12);
+        mytree.add(6);
+        mytree.add(8);
+        mytree.add(4);
+
+        tree.traversal().interval(myComparator, myComparator, v);
+        System.out.println(v.toString());
+        // assertEquals("levelorder", "BACD", v.toString());
+    }
+
+}
+
+class MyComparator implements Comparable<Integer> {
+    public int compare(TreeNode o1, TreeNode o2) {
+        return o1.element.compareTo(o1.element);
+    }
 }