From 08cf6a8d3fea26dc891783a0d08e30791643135e Mon Sep 17 00:00:00 2001 From: bculkin2442 Date: Fri, 18 Mar 2016 09:39:37 -0400 Subject: Reorganized tree packages. This is in preparation for addition of a non-searching binary tree. --- .../src/main/java/bjc/utils/funcdata/bst/BinarySearchTree.java | 7 ++++--- 1 file changed, 4 insertions(+), 3 deletions(-) (limited to 'BJC-Utils2/src/main/java/bjc/utils/funcdata/bst/BinarySearchTree.java') 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 7665797..3f65481 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 @@ -6,7 +6,8 @@ import java.util.List; import java.util.function.Predicate; import bjc.utils.funcdata.FunctionalList; -import bjc.utils.funcdata.bst.ITreePart.TreeLinearizationMethod; +import bjc.utils.funcdata.ITreePart; +import bjc.utils.funcdata.ITreePart.TreeLinearizationMethod; /** * A binary search tree, with some mild support for functional traversal. @@ -52,7 +53,7 @@ public class BinarySearchTree { nCount++; if (root == null) { - root = new TreeNode(dat, null, null); + root = new BinarySearchTreeNode(dat, null, null); } else { root.add(dat, comp); } @@ -74,7 +75,7 @@ public class BinarySearchTree { while ((piv - adj) >= 0 && (piv + adj) < elms.getSize()) { if (root == null) { - root = new TreeNode(elms.getByIndex(piv), null, null); + root = new BinarySearchTreeNode(elms.getByIndex(piv), null, null); } else { root.add(elms.getByIndex(piv + adj), comp); root.add(elms.getByIndex(piv - adj), comp); -- cgit v1.2.3