modify code structrue

src/class06/Test.java

@@ -1,5 +0,0 @@
-package class06;
-
-public class Test {
-
-}

src/class06_09/Code01_LinkedListMid.java

@@ -1,4 +1,4 @@
-package class06;
+package class06_09;
 
 import java.util.ArrayList;
 

src/class06_09/Code02_IsPalindromeList.java

@@ -1,4 +1,4 @@
-package class06;
+package class06_09;
 
 import java.util.Stack;
 

src/class06_09/Code03_SmallerEqualBigger.java

@@ -1,4 +1,4 @@
-package class06;
+package class06_09;
 
 public class Code03_SmallerEqualBigger {
 

src/class06_09/Code04_CopyListWithRandom.java

@@ -1,4 +1,4 @@
-package class06;
+package class06_09;
 
 import java.util.HashMap;
 

src/class07_10/Code01_FindFirstIntersectNode.java

@@ -1,6 +1,6 @@
-package class06;
+package class07_10;
 
-public class Code05_FindFirstIntersectNode {
+public class Code01_FindFirstIntersectNode {
 
 	public static class Node {
 		public int value;

src/class07_10/Code02_RecursiveTraversalBT.java

@@ -1,6 +1,6 @@
-package class07;
+package class07_10;
 
-public class Code01_RecursiveTraversalBT {
+public class Code02_RecursiveTraversalBT {
 
 	public static class Node {
 		public int value;

src/class07_10/Code03_UnRecursiveTraversalBT.java

@@ -1,8 +1,8 @@
-package class07;
+package class07_10;
 
 import java.util.Stack;
 
-public class Code02_UnRecursiveTraversalBT {
+public class Code03_UnRecursiveTraversalBT {
 
 	public static class Node {
 		public int value;

src/class07_11/Code01_LevelTraversalBT.java

@@ -1,9 +1,9 @@
-package class07;
+package class07_11;
 
 import java.util.LinkedList;
 import java.util.Queue;
 
-public class Code03_LevelTraversalBT {
+public class Code01_LevelTraversalBT {
 
 	public static class Node {
 		public int value;

src/class07_11/Code02_SerializeAndReconstructTree.java

@@ -1,10 +1,10 @@
-package class07;
+package class07_11;
 
 import java.util.LinkedList;
 import java.util.Queue;
 import java.util.Stack;
 
-public class Code04_SerializeAndReconstructTree {
+public class Code02_SerializeAndReconstructTree {
     /*
      * 二叉树可以通过先序、后序或者按层遍历的方式序列化和反序列化，
      * 以下代码全部实现了。

src/class07_11/Code03_PrintBinaryTree.java

@@ -1,6 +1,6 @@
-package class07;
+package class07_11;
 
-public class Code05_PrintBinaryTree {
+public class Code03_PrintBinaryTree {
 
 	public static class Node {
 		public int value;

src/class07_11/Code04_TreeMaxWidth.java

@@ -1,10 +1,10 @@
-package class07;
+package class07_11;
 
 import java.util.HashMap;
 import java.util.LinkedList;
 import java.util.Queue;
 
-public class Code06_TreeMaxWidth {
+public class Code04_TreeMaxWidth {
 
 	public static class Node {
 		public int value;

src/class07_11/Code05_SuccessorNode.java

@@ -1,6 +1,6 @@
-package class07;
+package class07_11;
 
-public class Code07_SuccessorNode {
+public class Code05_SuccessorNode {
 
 	public static class Node {
 		public int value;

src/class07_11/Code06_PaperFolding.java

@@ -1,6 +1,6 @@
-package class07;
+package class07_11;
 
-public class Code08_PaperFolding {
+public class Code06_PaperFolding {
 
 	public static void printAllFolds(int N) {
 		printProcess(1, N, true);