diff options
| author | Benjamin J. Culkin <bjculkin@mix.wvu.edu> | 2020-11-11 12:23:57 -0400 |
|---|---|---|
| committer | Benjamin J. Culkin <bjculkin@mix.wvu.edu> | 2020-11-11 12:23:57 -0400 |
| commit | 0805c271505340c1da60a1b8920560bae73f21a9 (patch) | |
| tree | 2703917145a8e8aee7bd4ad55634c65ed688dda6 /src/main/java/bjc/funcdata/bst | |
| parent | d3239ea7b6945d449c0361416ab54fec6f9643e6 (diff) | |
| parent | c56a10f7c943dd9e9f04854395638babfaba6529 (diff) | |
Merge branch 'master' of https://github.com/bculkin2442/esodata
Diffstat (limited to 'src/main/java/bjc/funcdata/bst')
| -rw-r--r-- | src/main/java/bjc/funcdata/bst/BinarySearchTree.java | 11 |
1 files changed, 4 insertions, 7 deletions
diff --git a/src/main/java/bjc/funcdata/bst/BinarySearchTree.java b/src/main/java/bjc/funcdata/bst/BinarySearchTree.java index e22a8da..2c5b4d8 100644 --- a/src/main/java/bjc/funcdata/bst/BinarySearchTree.java +++ b/src/main/java/bjc/funcdata/bst/BinarySearchTree.java @@ -33,8 +33,7 @@ public class BinarySearchTree<T> { * The thing to use for comparing elements */ public BinarySearchTree(final Comparator<T> cmp) { - if (cmp == null) - throw new NullPointerException("Comparator must not be null"); + if (cmp == null) throw new NullPointerException("Comparator must not be null"); elementCount = 0; comparator = cmp; @@ -49,11 +48,8 @@ public class BinarySearchTree<T> { public void addNode(final T element) { elementCount++; - if (root == null) { - root = new BinarySearchTreeNode<>(element, null, null); - } else { - root.add(element, comparator); - } + if (root == null) root = new BinarySearchTreeNode<>(element, null, null); + else root.add(element, comparator); } /** @@ -184,6 +180,7 @@ public class BinarySearchTree<T> { */ traverse(TreeLinearizationMethod.PREORDER, node -> { nodes.add(node); + return true; }); |