modify code structure

src/class07_11/Code02_SerializeAndReconstructTree.java

@@ -129,7 +129,7 @@ public class Code02_SerializeAndReconstructTree {
 			Queue<Node> queue = new LinkedList<Node>();
 			queue.add(head);
 			while (!queue.isEmpty()) {
-				head = queue.poll();
+				head = queue.poll(); // head 父   子
 				if (head.left != null) {
 					ans.add(String.valueOf(head.left.value));
 					queue.add(head.left);

src/class07_11/Code07_PaperFolding.java

@@ -3,22 +3,26 @@ package class07_11;
 public class Code07_PaperFolding {
 
 	public static void printAllFolds(int N) {
-		printProcess(1, N, true);
+		process(1, N, true);
+		System.out.println();
 	}
 
-	// 递归过程，来到了某一个节点，
+	// 当前你来了一个节点，脑海中想象的！
-	// i是节点的层数，N一共的层数，down == true  凹    down == false 凸
+	// 这个节点在第i层，一共有N层，N固定不变的
-	public static void printProcess(int i, int N, boolean down) {
+	// 这个节点如果是凹的话，down = T
+	// 这个节点如果是凸的话，down = F
+	// 函数的功能：中序打印以你想象的节点为头的整棵树！
+	public static void process(int i, int N, boolean down) {
 		if (i > N) {
 			return;
 		}
-		printProcess(i + 1, N, true);
+		process(i + 1, N, true);
-		System.out.println(down ? "凹 " : "凸 ");
+		System.out.print(down ? "凹 " : "凸 ");
-		printProcess(i + 1, N, false);
+		process(i + 1, N, false);
 	}
 
 	public static void main(String[] args) {
-		int N = 3;
+		int N = 4;
 		printAllFolds(N);
 	}
 }

src/class08_12/Code01_IsCBT.java

@@ -1,8 +1,8 @@
-package class08;
+package class08_12;
 
 import java.util.LinkedList;
 
-public class Code06_IsCBT {
+public class Code01_IsCBT {
 
 	public static class Node {
 		public int value;

src/class08_12/Code02_IsBST.java

@@ -1,8 +1,8 @@
-package class08;
+package class08_12;
 
 import java.util.ArrayList;
 
-public class Code03_IsBST {
+public class Code02_IsBST {
 
 	public static class Node {
 		public int value;

src/class08_12/Code03_IsBalanced.java

@@ -1,6 +1,6 @@
-package class08;
+package class08_12;
 
-public class Code01_IsBalanced {
+public class Code03_IsBalanced {
 
 	public static class Node {
 		public int value;

src/class08_12/Code04_IsFull.java

@@ -1,6 +1,6 @@
-package class08;
+package class08_12;
 
-public class Code02_IsFull {
+public class Code04_IsFull {
 
 	public static class Node {
 		public int value;

src/class08_12/Code05_MaxSubBSTSize.java

@@ -1,8 +1,8 @@
-package class08;
+package class08_12;
 
 import java.util.ArrayList;
 
-public class Code04_MaxSubBSTSize {
+public class Code05_MaxSubBSTSize {
 
 	public static class Node {
 		public int value;

src/class08_12/Code06_MaxSubBSTHead.java

@@ -1,8 +1,8 @@
-package class08;
+package class08_12;
 
 import java.util.ArrayList;
 
-public class Code05_MaxSubBSTHead {
+public class Code06_MaxSubBSTHead {
 
 	public static class Node {
 		public int value;

src/class08_12/Code07_lowestAncestor.java

@@ -1,4 +1,4 @@
-package class08;
+package class08_12;
 
 import java.util.ArrayList;
 import java.util.HashMap;

src/class08_12/Code08_MaxDistance.java

@@ -1,4 +1,4 @@
-package class08;
+package class08_12;
 
 import java.util.ArrayList;
 import java.util.HashMap;

src/class08_12/Code09_MaxHappy.java

@@ -1,4 +1,4 @@
-package class08;
+package class08_12;
 
 import java.util.ArrayList;
 import java.util.List;