Formatting

1 files changed, 12 insertions, 12 deletions

diff --git a/BJC-Utils2/src/main/java/bjc/utils/funcdata/bst/BinarySearchTreeLeaf.java b/BJC-Utils2/src/main/java/bjc/utils/funcdata/bst/BinarySearchTreeLeaf.java
index d647742..04765b4 100644
--- a/BJC-Utils2/src/main/java/bjc/utils/funcdata/bst/BinarySearchTreeLeaf.java
+++ b/BJC-Utils2/src/main/java/bjc/utils/funcdata/bst/BinarySearchTreeLeaf.java
@@ -11,24 +11,24 @@ import java.util.function.Predicate;
  * @author ben
  *
  * @param <T>
- *            The data stored in the tree.
+ *                The data stored in the tree.
  */
 public class BinarySearchTreeLeaf<T> implements ITreePart<T> {
 	/**
 	 * The data held in this tree leaf
 	 */
-	protected T			data;
+	protected T data;
 
 	/**
 	 * Whether this node is soft-deleted or not
 	 */
-	protected boolean	isDeleted;
+	protected boolean isDeleted;
 
 	/**
 	 * Create a new leaf holding the specified data.
 	 * 
 	 * @param element
-	 *            The data for the leaf to hold.
+	 *                The data for the leaf to hold.
 	 */
 	public BinarySearchTreeLeaf(T element) {
 		data = element;
@@ -72,14 +72,14 @@ public class BinarySearchTreeLeaf<T> implements ITreePart<T> {
 		}
 
 		switch (treeWalker.walk(data)) {
-			case SUCCESS:
-				return true;
-			// We don't have any children to care about
-			case FAILURE:
-			case LEFT:
-			case RIGHT:
-			default:
-				return false;
+		case SUCCESS:
+			return true;
+		// We don't have any children to care about
+		case FAILURE:
+		case LEFT:
+		case RIGHT:
+		default:
+			return false;
 		}
 	}