From 9adff31e86603493c2a245e1e803d951675d5e00 Mon Sep 17 00:00:00 2001
From: bculkin2442 <bjculkin@mix.wvu.edu>
Date: Wed, 13 Apr 2016 23:11:36 -0400
Subject: Implemented new tree abstraction

---
 .../bjc/utils/funcdata/bst/BinarySearchTree.java   |  1 -
 .../java/bjc/utils/funcdata/bst/ITreePart.java     | 24 ---------------------
 .../funcdata/bst/TreeLinearizationMethod.java      | 25 ++++++++++++++++++++++
 3 files changed, 25 insertions(+), 25 deletions(-)
 create mode 100644 BJC-Utils2/src/main/java/bjc/utils/funcdata/bst/TreeLinearizationMethod.java

(limited to 'BJC-Utils2/src/main/java/bjc/utils/funcdata/bst')

diff --git a/BJC-Utils2/src/main/java/bjc/utils/funcdata/bst/BinarySearchTree.java b/BJC-Utils2/src/main/java/bjc/utils/funcdata/bst/BinarySearchTree.java
index 67b9985..6e9d14e 100644
--- a/BJC-Utils2/src/main/java/bjc/utils/funcdata/bst/BinarySearchTree.java
+++ b/BJC-Utils2/src/main/java/bjc/utils/funcdata/bst/BinarySearchTree.java
@@ -7,7 +7,6 @@ import java.util.function.Predicate;
 
 import bjc.utils.funcdata.FunctionalList;
 import bjc.utils.funcdata.IFunctionalList;
-import bjc.utils.funcdata.bst.ITreePart.TreeLinearizationMethod;
 
 /**
  * A binary search tree, with some mild support for functional traversal.
diff --git a/BJC-Utils2/src/main/java/bjc/utils/funcdata/bst/ITreePart.java b/BJC-Utils2/src/main/java/bjc/utils/funcdata/bst/ITreePart.java
index 8fa5a3d..cbd7229 100644
--- a/BJC-Utils2/src/main/java/bjc/utils/funcdata/bst/ITreePart.java
+++ b/BJC-Utils2/src/main/java/bjc/utils/funcdata/bst/ITreePart.java
@@ -14,30 +14,6 @@ import java.util.function.Predicate;
  *            The data contained in this part of the tree.
  */
 public interface ITreePart<T> {
-	/**
-	 * Represents the ways to linearize a tree for traversal.
-	 * 
-	 * @author ben
-	 *
-	 */
-	public enum TreeLinearizationMethod {
-		/**
-		 * Visit the left side of this tree part, the tree part itself, and
-		 * then the right part.
-		 */
-		INORDER,
-		/**
-		 * Visit the left side of this tree part, the right side, and then
-		 * the tree part itself.
-		 */
-		POSTORDER,
-		/**
-		 * Visit the tree part itself, then the left side of tthis tree
-		 * part and then the right part.
-		 */
-		PREORDER
-	}
-
 	/**
 	 * Add a element below this tree part somewhere.
 	 * 
diff --git a/BJC-Utils2/src/main/java/bjc/utils/funcdata/bst/TreeLinearizationMethod.java b/BJC-Utils2/src/main/java/bjc/utils/funcdata/bst/TreeLinearizationMethod.java
new file mode 100644
index 0000000..6c15284
--- /dev/null
+++ b/BJC-Utils2/src/main/java/bjc/utils/funcdata/bst/TreeLinearizationMethod.java
@@ -0,0 +1,25 @@
+package bjc.utils.funcdata.bst;
+
+/**
+ * Represents the ways to linearize a tree for traversal.
+ * 
+ * @author ben
+ *
+ */
+public enum TreeLinearizationMethod {
+	/**
+	 * Visit the left side of this tree part, the tree part itself, and
+	 * then the right part.
+	 */
+	INORDER,
+	/**
+	 * Visit the left side of this tree part, the right side, and then
+	 * the tree part itself.
+	 */
+	POSTORDER,
+	/**
+	 * Visit the tree part itself, then the left side of tthis tree
+	 * part and then the right part.
+	 */
+	PREORDER
+}
\ No newline at end of file
-- 
cgit v1.2.3