From 01cb9f504c860bc1c037a44f3a76bf342a293d46 Mon Sep 17 00:00:00 2001
From: bculkin2442 <bjculkin@mix.wvu.edu>
Date: Tue, 22 Mar 2016 12:28:35 -0400
Subject: General formatting cleanup and documentation update

---
 .../src/main/java/bjc/utils/funcdata/bst/BinarySearchTree.java       | 5 +++--
 1 file changed, 3 insertions(+), 2 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 3f65481..0bd0119 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
@@ -53,7 +53,7 @@ public class BinarySearchTree<T> {
 		nCount++;
 
 		if (root == null) {
-			root = new BinarySearchTreeNode<T>(dat, null, null);
+			root = new BinarySearchTreeNode<>(dat, null, null);
 		} else {
 			root.add(dat, comp);
 		}
@@ -75,7 +75,8 @@ public class BinarySearchTree<T> {
 
 		while ((piv - adj) >= 0 && (piv + adj) < elms.getSize()) {
 			if (root == null) {
-				root = new BinarySearchTreeNode<T>(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