修改包的名字

src/main/java/com/ossez/codebank/algorithm/Main.java

@@ -1,4 +1,4 @@
-package com.ossez.lang.tutorial;
+package com.ossez.codebank.algorithm;
 
 import java.util.Properties;
 

src/main/java/com/ossez/codebank/algorithm/models/ListNode.java

@@ -1,4 +1,4 @@
-package com.ossez.lang.tutorial.models;
+package com.ossez.codebank.algorithm.models;
 
 /**
  * 

src/main/java/com/ossez/codebank/algorithm/models/TreeNode.java

@@ -1,4 +1,4 @@
-package com.ossez.lang.tutorial.models;
+package com.ossez.codebank.algorithm.models;
 
 /**
  * 

src/main/java/com/ossez/codebank/algorithm/objplusclass/CreateObject.java

@@ -1,4 +1,4 @@
-package com.ossez.lang.tutorial.objplusclass;
+package com.ossez.codebank.algorithm.objplusclass;
 
 /**
  * 

src/main/java/com/ossez/codebank/algorithm/overview/FreshJuiceEnums.java

@@ -1,4 +1,4 @@
-package com.ossez.lang.tutorial.overview;
+package com.ossez.codebank.algorithm.overview;
 
 /**
  * Java Tutorial

src/main/java/com/ossez/codebank/algorithm/overview/HelloWorld.java

@@ -1,4 +1,4 @@
-package com.ossez.lang.tutorial.overview;
+package com.ossez.codebank.algorithm.overview;
 
 /**
  * Java Tutorial

src/main/java/com/ossez/lang/tutorial/utils/TreeUtils.java

@@ -1,55 +0,0 @@
-package com.ossez.lang.tutorial.utils;
-
-import java.util.ArrayList;
-
-import com.ossez.lang.tutorial.models.TreeNode;
-
-/**
- * 
- * @author YuCheng
- *
- */
-public class TreeUtils {
-
-	public static TreeNode initTree(String data) {
-		// NULL CHECK
-		if (data.equals("{}")) {
-			return null;
-		}
-
-		ArrayList<TreeNode> treeList = new ArrayList<TreeNode>();
-
-		data = data.replace("{", "");
-		data = data.replace("}", "");
-		String[] vals = data.split(",");
-
-		// INSERT ROOT
-		TreeNode root = new TreeNode(Integer.parseInt(vals[0]));
-		treeList.add(root);
-
-		int index = 0;
-		boolean isLeftChild = true;
-		for (int i = 1; i < vals.length; i++) {
-			if (!vals[i].equals("#")) {
-				TreeNode node = new TreeNode(Integer.parseInt(vals[i]));
-				if (isLeftChild) {
-					treeList.get(index).left = node;
-				} else {
-					treeList.get(index).right = node;
-				}
-				treeList.add(node);
-			}
-
-			// LEVEL
-			if (!isLeftChild) {
-				index++;
-			}
-
-			// MOVE TO RIGHT OR NEXT LEVEL
-			isLeftChild = !isLeftChild;
-		}
-
-		return root;
-
-	}
-}