Move print to right place

src/aud/exam/prep/tree/OrderedBinaryTreeNodeProcessor.java

@@ -1,6 +1,7 @@
 package aud.exam.prep.tree;
 
 abstract class OrderedBinaryTreeNodeProcessor<V> implements OrderedTreeProcessor<V, BinaryTreeNode<V>> {
+
     @Override
     public BinaryTreeNode<V> newEmptyTree() {
         return null;
@@ -11,26 +12,4 @@ abstract class OrderedBinaryTreeNodeProcessor<V> implements OrderedTreeProcessor
         return () ->
             new BinaryTreeIterator<>(tree);
     }
-
-    @Override
-    public void print(BinaryTreeNode<V> tree) {
-        printRec(tree, 0);
-    }
-
-    private void printRec(BinaryTreeNode<V> tree, int indent) {
-        if (tree == null) {
-            System.out.println("- *");
-            return;
-        }
-
-        System.out.println("-> " + tree.key);
-
-        System.out.print(" |".repeat(indent));
-        System.out.print(" L");
-        printRec(tree.left, indent + 1);
-
-        System.out.print(" |".repeat(indent));
-        System.out.print(" L");
-        printRec(tree.right, indent + 1);
-    }
 }

src/aud/exam/prep/tree/RecursiveOrderedBinaryTreeNodeProcessor.java

@@ -331,4 +331,26 @@ public class RecursiveOrderedBinaryTreeNodeProcessor<V> extends OrderedBinaryTre
 
         return true;
     }
+
+    @Override
+    public void print(BinaryTreeNode<V> tree) {
+        printRec(tree, 0);
+    }
+
+    private void printRec(BinaryTreeNode<V> tree, int indent) {
+        if (tree == null) {
+            System.out.println("- *");
+            return;
+        }
+
+        System.out.println("-> " + tree.key);
+
+        System.out.print(" |".repeat(indent));
+        System.out.print(" L");
+        printRec(tree.left, indent + 1);
+
+        System.out.print(" |".repeat(indent));
+        System.out.print(" L");
+        printRec(tree.right, indent + 1);
+    }
 }