03.01(1) rename

stevencooks · stevencooks · commit dfef84666b46 · 2015-09-01T10:11:27.000-04:00
diff --git a/03_binarytree&divideconquer/_01_InsertNodeInABinarySearchTree/Solution.java b/03_binarytree&divideconquer/_01_InsertNodeInABinarySearchTree/Solution.java
@@ -10,11 +10,11 @@
  ***************************************************************************
  * {@link http://www.lintcode.com/en/problem/insert-node-in-a-binary-search-tree/# }
  */
-package InsertNodeInABinarySearchTree;
+package _01_InsertNodeInABinarySearchTree;
 
 import com.leetcode.TreeNode;
 
-/** see test {@link InsertNodeInABinarySearchTree.SolutionTest } */
+/** see test {@link _01_InsertNodeInABinarySearchTree.SolutionTest } */
 public class Solution {
 
     public TreeNode insertNode(TreeNode root, TreeNode node) {
diff --git a/03_binarytree&divideconquer/_01_InsertNodeInABinarySearchTree/SolutionTest.java b/03_binarytree&divideconquer/_01_InsertNodeInABinarySearchTree/SolutionTest.java
@@ -1,4 +1,4 @@
-package InsertNodeInABinarySearchTree;
+package _01_InsertNodeInABinarySearchTree;
 
 import static org.junit.Assert.*;
 
@@ -12,7 +12,7 @@
 
 public class SolutionTest {
     
-    /** Test method for {@link InsertNodeInABinarySearchTree.Solution } */
+    /** Test method for {@link _01_InsertNodeInABinarySearchTree.Solution } */
     Solution solution;
 
     @Rule
