From e4c4da8fb90ebdd87aec80ee4351f80d414c6315 Mon Sep 17 00:00:00 2001
From: Manuel Thalmann <m@nuth.ch>
Date: Tue, 18 Oct 2022 14:29:29 +0200
Subject: [PATCH] Allow traversing intervals

---
 .../ch/nuth/zhaw/exbox/TreeTraversal.java     | 27 ++++++++++++++++---
 1 file changed, 23 insertions(+), 4 deletions(-)

diff --git a/app/src/main/java/ch/nuth/zhaw/exbox/TreeTraversal.java b/app/src/main/java/ch/nuth/zhaw/exbox/TreeTraversal.java
index cf9990f..1b45e0b 100644
--- a/app/src/main/java/ch/nuth/zhaw/exbox/TreeTraversal.java
+++ b/app/src/main/java/ch/nuth/zhaw/exbox/TreeTraversal.java
@@ -52,7 +52,7 @@ public class TreeTraversal<T extends Comparable<T>> implements Traversal<T> {
         queue.add(root);
 
         while (!queue.isEmpty()) {
-            TreeNode<T> node = queue.poll();
+            TreeNode<T> node = queue.pop();
 
             if (node.left != null) {
                 queue.add(node.left);
@@ -67,8 +67,27 @@ public class TreeTraversal<T extends Comparable<T>> implements Traversal<T> {
     }
 
     @Override
-    public void interval(T min, T max, Visitor<T> vistor) {
-        // TODO Auto-generated method stub
-        
+    public void interval(T min, T max, Visitor<T> visitor) {
+        Deque<TreeNode<T>> queue = new LinkedList<>();
+        queue.add(root);
+
+        while (!queue.isEmpty()) {
+            TreeNode<T> node = queue.pop();
+
+            if (node != null) {
+                T value = node.getValue();
+    
+                if (value.compareTo(min) >= 0 && value.compareTo(max) <= 0) {
+                    visitor.visit(value);
+                    queue.add(node.left);
+                    queue.add(node.right);
+                } else if (value.compareTo(max) > 0) {
+                    queue.add(node.left);
+                }
+                else if (value.compareTo(min) < 0) {
+                    queue.add(node.right);
+                }
+            }
+        }
     }
 }