diff --git a/CLion/CourseBook/0206_SLinkList/SLinkList.c b/CLion/CourseBook/0206_SLinkList/SLinkList.c
index 222c15d..bacf48e 100644
--- a/CLion/CourseBook/0206_SLinkList/SLinkList.c
+++ b/CLion/CourseBook/0206_SLinkList/SLinkList.c
@@ -450,8 +450,8 @@ void ListTraverse(SLinkList space, int S, void(Visit)(ElemType)) {
 
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
-// 以图形化形式输出当前结构，仅限内部测试使用
-void PrintGraph(SLinkList space, int S) {
+// 以图形化形式输出当前结构
+void PrintList(SLinkList space, int S) {
     int i = 0;
     
     printf("==== 备用空间 ====\n");
diff --git a/CLion/CourseBook/0206_SLinkList/SLinkList.h b/CLion/CourseBook/0206_SLinkList/SLinkList.h
index d961fc8..2ec685c 100644
--- a/CLion/CourseBook/0206_SLinkList/SLinkList.h
+++ b/CLion/CourseBook/0206_SLinkList/SLinkList.h
@@ -202,7 +202,7 @@ void ListTraverse(SLinkList space, int S, void(Visit)(ElemType));
 
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
-// 以图形化形式输出当前结构，仅限内部测试使用
-void PrintGraph(SLinkList space, int S);
+// 以图形化形式输出当前结构
+void PrintList(SLinkList space, int S);
 
 #endif
diff --git a/CLion/CourseBook/0207_Difference/SLinkList.c b/CLion/CourseBook/0207_Difference/SLinkList.c
index 4e09106..319c8ad 100644
--- a/CLion/CourseBook/0207_Difference/SLinkList.c
+++ b/CLion/CourseBook/0207_Difference/SLinkList.c
@@ -98,7 +98,7 @@ void ListTraverse(SLinkList space, int S, void(Visit)(ElemType)) {
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构，仅限内部测试使用
-void PrintGraph(SLinkList space, int S) {
+void PrintList(SLinkList space, int S) {
     int i = 0;
     
     printf("==== 备用空间 ====\n");
diff --git a/CLion/CourseBook/0207_Difference/SLinkList.h b/CLion/CourseBook/0207_Difference/SLinkList.h
index fc2e30d..02ec9df 100644
--- a/CLion/CourseBook/0207_Difference/SLinkList.h
+++ b/CLion/CourseBook/0207_Difference/SLinkList.h
@@ -84,6 +84,6 @@ void ListTraverse(SLinkList space, int S, void(Visit)(ElemType));
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构，仅限内部测试使用
-void PrintGraph(SLinkList space, int S);
+void PrintList(SLinkList space, int S);
 
 #endif
diff --git a/CLion/CourseBook/0210_MergeEList/MergeEList.c b/CLion/CourseBook/0210_MergeEList/MergeEList.c
index 9984ca1..fa75059 100644
--- a/CLion/CourseBook/0210_MergeEList/MergeEList.c
+++ b/CLion/CourseBook/0210_MergeEList/MergeEList.c
@@ -72,4 +72,4 @@ Status MergeEList(ELinkList* La, ELinkList* Lb, ELinkList* Lc, int(Compare)(Elem
     Lb->len = 0;
     
     return OK;
-}
\ No newline at end of file
+}
diff --git a/CLion/CourseBook/0210_MergeEList/MergeEList.h b/CLion/CourseBook/0210_MergeEList/MergeEList.h
index 7c084b7..2b0e218 100644
--- a/CLion/CourseBook/0210_MergeEList/MergeEList.h
+++ b/CLion/CourseBook/0210_MergeEList/MergeEList.h
@@ -27,10 +27,4 @@
  */
 Status MergeEList(ELinkList* La, ELinkList* Lb, ELinkList* Lc, int(Compare)(ElemType, ElemType));
 
-/*━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━┓
-┃(01)算法2.21：La与Lb均非递减排列，将其归并为一个非递减排列的单链表Lc。┃
-┗━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━*/
-
-
-
 #endif
diff --git a/CLion/CourseBook/0505_GList-HT/GList-HT-main.c b/CLion/CourseBook/0505_GList-HT/GList-HT-main.c
index 5f2a20b..afd1110 100644
--- a/CLion/CourseBook/0505_GList-HT/GList-HT-main.c
+++ b/CLion/CourseBook/0505_GList-HT/GList-HT-main.c
@@ -61,10 +61,10 @@ int main(int argc, char** argv) {
     }
     PressEnterToContinue();
     
-    printf("████████ 函数 PrintGraph \n");
+    printf("████████ 函数 PrintGList \n");
     {
         printf("█ 带括号输出广义表 Tmp = ");
-        PrintGraph(Tmp);
+        PrintGList(Tmp);
     }
     PressEnterToContinue();
     
@@ -72,7 +72,7 @@ int main(int argc, char** argv) {
     {
         printf("█ 复制 Tmp 到 G = ");
         CopyGList(&G, Tmp);
-        PrintGraph(G);
+        PrintGList(G);
     }
     PressEnterToContinue();
     
@@ -83,10 +83,10 @@ int main(int argc, char** argv) {
         printf("█ 删除广义表 Tmp 的表头：");
         
         DeleteFirst(&Tmp, &h);
-        PrintGraph(h);
+        PrintGList(h);
         
         printf("█ Tmp = ");
-        PrintGraph(Tmp);
+        PrintGList(Tmp);
     }
     PressEnterToContinue();
     
@@ -108,7 +108,7 @@ int main(int argc, char** argv) {
         
         printf("█ 广义表 G 的表头 H = ");
         H = GetHead(G);
-        PrintGraph(H);
+        PrintGList(H);
     }
     PressEnterToContinue();
     
@@ -118,7 +118,7 @@ int main(int argc, char** argv) {
         
         printf("█ 广义表 G 的表尾 T = ");
         T = GetTail(G);
-        PrintGraph(T);
+        PrintGList(T);
     }
     PressEnterToContinue();
     
diff --git a/CLion/CourseBook/0505_GList-HT/GList-HT.c b/CLion/CourseBook/0505_GList-HT/GList-HT.c
index ddf2766..9b8e3cc 100644
--- a/CLion/CourseBook/0505_GList-HT/GList-HT.c
+++ b/CLion/CourseBook/0505_GList-HT/GList-HT.c
@@ -335,7 +335,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * 带括号输出广义表L。
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L, Head);
     printf("\n");
 }
diff --git a/CLion/CourseBook/0505_GList-HT/GList-HT.h b/CLion/CourseBook/0505_GList-HT/GList-HT.h
index 07c0df2..12371eb 100644
--- a/CLion/CourseBook/0505_GList-HT/GList-HT.h
+++ b/CLion/CourseBook/0505_GList-HT/GList-HT.h
@@ -143,7 +143,7 @@ void Traverse(GList L, void (Visit)(AtomType));
  *
  * 带括号输出广义表L。
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * 图形化输出的内部实现，mark是图形化输出标记。
diff --git a/CLion/CourseBook/0506_GList-E/GList-E-main.c b/CLion/CourseBook/0506_GList-E/GList-E-main.c
index 6aa1fd9..2250e5e 100644
--- a/CLion/CourseBook/0506_GList-E/GList-E-main.c
+++ b/CLion/CourseBook/0506_GList-E/GList-E-main.c
@@ -61,10 +61,10 @@ int main(int argc, char** argv) {
     }
     PressEnterToContinue();
     
-    printf("████████ 函数 PrintGraph \n");
+    printf("████████ 函数 PrintGList \n");
     {
         printf("█ 带括号输出广义表 Tmp = ");
-        PrintGraph(Tmp);
+        PrintGList(Tmp);
     }
     PressEnterToContinue();
     
@@ -72,7 +72,7 @@ int main(int argc, char** argv) {
     {
         printf("█ 复制 Tmp 到 G = ");
         CopyGList(&G, Tmp);
-        PrintGraph(G);
+        PrintGList(G);
     }
     PressEnterToContinue();
     
@@ -83,10 +83,10 @@ int main(int argc, char** argv) {
         printf("█ 删除广义表 Tmp 的表头：");
         DeleteFirst(&Tmp, &h);
         
-        PrintGraph(h);
+        PrintGList(h);
         
         printf("█ Tmp = ");
-        PrintGraph(Tmp);
+        PrintGList(Tmp);
     }
     PressEnterToContinue();
     
@@ -108,7 +108,7 @@ int main(int argc, char** argv) {
         
         printf("█ 获取广义表 G 的表头 H = ");
         H = GetHead(G);
-        PrintGraph(H);
+        PrintGList(H);
     }
     PressEnterToContinue();
     
@@ -118,7 +118,7 @@ int main(int argc, char** argv) {
         
         printf("█ 获取广义表 G 的表尾 T = ");
         T = GetTail(G);
-        PrintGraph(T);
+        PrintGList(T);
     }
     PressEnterToContinue();
     
diff --git a/CLion/CourseBook/0506_GList-E/GList-E.c b/CLion/CourseBook/0506_GList-E/GList-E.c
index d994024..a7ca33a 100644
--- a/CLion/CourseBook/0506_GList-E/GList-E.c
+++ b/CLion/CourseBook/0506_GList-E/GList-E.c
@@ -370,7 +370,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * 带括号输出广义表L。
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L);
     printf("\n");
 }
diff --git a/CLion/CourseBook/0506_GList-E/GList-E.h b/CLion/CourseBook/0506_GList-E/GList-E.h
index 5e5b625..aa58fa0 100644
--- a/CLion/CourseBook/0506_GList-E/GList-E.h
+++ b/CLion/CourseBook/0506_GList-E/GList-E.h
@@ -126,7 +126,7 @@ void Traverse(GList L, void(Visit)(AtomType));
  *
  * 带括号输出广义表L。
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * 图形化输出的内部实现。
diff --git a/CLion/CourseBook/0507_MPList/MPList-main.c b/CLion/CourseBook/0507_MPList/MPList-main.c
index a888239..4daabb6 100644
--- a/CLion/CourseBook/0507_MPList/MPList-main.c
+++ b/CLion/CourseBook/0507_MPList/MPList-main.c
@@ -7,5 +7,5 @@ int main(int argc, char** argv) {
     
     printf("创建三元多项式...\n");
     CreateMPList(&P, s, "zxy");
-    PrintGraph(P);
+    PrintMPList(P);
 }
diff --git a/CLion/CourseBook/0507_MPList/MPList.c b/CLion/CourseBook/0507_MPList/MPList.c
index 8eb4455..8b02015 100644
--- a/CLion/CourseBook/0507_MPList/MPList.c
+++ b/CLion/CourseBook/0507_MPList/MPList.c
@@ -111,7 +111,7 @@ static Status Create(MPList* P, char* S) {
  *
  * 带括号输出m元多项P。
  */
-void PrintGraph(MPList P) {
+void PrintMPList(MPList P) {
     if(P == NULL) {
         printf("\n");
         return;
diff --git a/CLion/CourseBook/0507_MPList/MPList.h b/CLion/CourseBook/0507_MPList/MPList.h
index baef8e3..a23fe0d 100644
--- a/CLion/CourseBook/0507_MPList/MPList.h
+++ b/CLion/CourseBook/0507_MPList/MPList.h
@@ -72,7 +72,7 @@ static Status Create(MPList* P, char* S);
  *
  * 带括号输出m元多项P。
  */
-void PrintGraph(MPList P);
+void PrintMPList(MPList P);
 
 /*
  * 图形化输出的内部实现
diff --git a/CLion/CourseBook/0601_SqBiTree/SqBiTree-main.c b/CLion/CourseBook/0601_SqBiTree/SqBiTree-main.c
index 29e6025..9168f97 100644
--- a/CLion/CourseBook/0601_SqBiTree/SqBiTree-main.c
+++ b/CLion/CourseBook/0601_SqBiTree/SqBiTree-main.c
@@ -35,10 +35,10 @@ int main(int argc, char* argv[]) {
     PressEnterToContinue();
     
     
-    printf("████████ PrintGraph \n");
+    printf("████████ PrintTree \n");
     {
         printf("█ 按二叉树的结构打印树 T ...\n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -89,7 +89,7 @@ int main(int argc, char* argv[]) {
         TElemType value = 'X';
         printf("█ 将结点 %c 赋值为 %c 后，T = \n", e, value);
         Assign(T, e, value);
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -142,20 +142,20 @@ int main(int argc, char* argv[]) {
         printf("█ 创建子树 c1 ...\n");
         InitBiTree(c1);
         CreateBiTree(c1, "TestData_c1.txt");
-        PrintGraph(c1);
+        PrintTree(c1);
     
         printf("█ 创建子树 c2 ...\n");
         InitBiTree(c2);
         CreateBiTree(c2, "TestData_c2.txt");
-        PrintGraph(c2);
+        PrintTree(c2);
     
         printf("█ 将子树 c1 插入为二叉树 T 中 %c 结点的右子树 ...\n", p1);
         InsertChild(T, p1, 1, c1);
-        PrintGraph(T);
+        PrintTree(T);
     
         printf("█ 将子树 c2 插入为二叉树 T 中 %c 结点的左子树 ...\n", p2);
         InsertChild(T, p2, 0, c2);
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -167,11 +167,11 @@ int main(int argc, char* argv[]) {
     
         printf("█ 删除二叉树 T 中 %c 结点的右子树 ...\n", p1);
         DeleteChild(T, p1, 1);
-        PrintGraph(T);
+        PrintTree(T);
     
         printf("█ 删除二叉树 T 中 %c 结点的左子树 ...\n", p2);
         DeleteChild(T, p2, 0);
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
diff --git a/CLion/CourseBook/0601_SqBiTree/SqBiTree.c b/CLion/CourseBook/0601_SqBiTree/SqBiTree.c
index 6bab116..59bdb39 100644
--- a/CLion/CourseBook/0601_SqBiTree/SqBiTree.c
+++ b/CLion/CourseBook/0601_SqBiTree/SqBiTree.c
@@ -628,7 +628,7 @@ static Status PostTraverse(SqBiTree T, Status(Visit)(TElemType), int i) {
 
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
-void PrintGraph(SqBiTree T) {
+void PrintTree(SqBiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/CLion/CourseBook/0601_SqBiTree/SqBiTree.h b/CLion/CourseBook/0601_SqBiTree/SqBiTree.h
index f1657af..f7bc1c4 100644
--- a/CLion/CourseBook/0601_SqBiTree/SqBiTree.h
+++ b/CLion/CourseBook/0601_SqBiTree/SqBiTree.h
@@ -205,6 +205,6 @@ static Status PostTraverse(SqBiTree T, Status(Visit)(TElemType), int i);
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构，仅限内部测试使用
-void PrintGraph(SqBiTree T);
+void PrintTree(SqBiTree T);
 
 #endif
diff --git a/CLion/CourseBook/0602_BiTree/BiTree-main.c b/CLion/CourseBook/0602_BiTree/BiTree-main.c
index 55f3f18..677ecb4 100644
--- a/CLion/CourseBook/0602_BiTree/BiTree-main.c
+++ b/CLion/CourseBook/0602_BiTree/BiTree-main.c
@@ -35,10 +35,10 @@ int main(int argc, char* argv[]) {
     PressEnterToContinue();
     
     
-    printf("████████ PrintGraph \n");
+    printf("████████ PrintTree \n");
     {
         printf("█ 按二叉树的结构打印树 T ...\n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -89,7 +89,7 @@ int main(int argc, char* argv[]) {
         TElemType value = 'X';
         printf("█ 将结点 %c 赋值为 %c 后，T = \n", e, value);
         Assign(T, e, value);
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -142,20 +142,20 @@ int main(int argc, char* argv[]) {
         printf("█ 创建子树 c1 ...\n");
         InitBiTree(&c1);
         CreateBiTree(&c1, "TestData_c1.txt");
-        PrintGraph(c1);
+        PrintTree(c1);
         
         printf("█ 创建子树 c2 ...\n");
         InitBiTree(&c2);
         CreateBiTree(&c2, "TestData_c2.txt");
-        PrintGraph(c2);
+        PrintTree(c2);
         
         printf("█ 将子树 c1 插入为二叉树 T 中 %c 结点的右子树 ...\n", p1);
         InsertChild(T, p1, 1, c1);
-        PrintGraph(T);
+        PrintTree(T);
         
         printf("█ 将子树 c2 插入为二叉树 T 中 %c 结点的左子树 ...\n", p2);
         InsertChild(T, p2, 0, c2);
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -167,11 +167,11 @@ int main(int argc, char* argv[]) {
         
         printf("█ 删除二叉树 T 中 %c 结点的右子树 ...\n", p1);
         DeleteChild(T, p1, 1);
-        PrintGraph(T);
+        PrintTree(T);
         
         printf("█ 删除二叉树 T 中 %c 结点的左子树 ...\n", p2);
         DeleteChild(T, p2, 0);
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
diff --git a/CLion/CourseBook/0602_BiTree/BiTree.c b/CLion/CourseBook/0602_BiTree/BiTree.c
index 9d6bcac..a2b3314 100644
--- a/CLion/CourseBook/0602_BiTree/BiTree.c
+++ b/CLion/CourseBook/0602_BiTree/BiTree.c
@@ -700,7 +700,7 @@ static Status PostTraverse(BiTree T, Status(Visit)(TElemType)) {
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构，仅限内部测试使用
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/CLion/CourseBook/0602_BiTree/BiTree.h b/CLion/CourseBook/0602_BiTree/BiTree.h
index 1dd33bd..93f58a2 100644
--- a/CLion/CourseBook/0602_BiTree/BiTree.h
+++ b/CLion/CourseBook/0602_BiTree/BiTree.h
@@ -225,6 +225,6 @@ static Status PostTraverse(BiTree T, Status(Visit)(TElemType));
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构，仅限内部测试使用
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/CLion/CourseBook/0603_BiTriTree/BiTriTree-main.c b/CLion/CourseBook/0603_BiTriTree/BiTriTree-main.c
index 57da304..6237155 100644
--- a/CLion/CourseBook/0603_BiTriTree/BiTriTree-main.c
+++ b/CLion/CourseBook/0603_BiTriTree/BiTriTree-main.c
@@ -34,10 +34,10 @@ int main(int argc, char* argv[]) {
     PressEnterToContinue();
     
     
-    printf("████████ PrintGraph \n");
+    printf("████████ PrintTree \n");
     {
         printf("█ 按二叉树的结构打印树 T ...\n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -88,7 +88,7 @@ int main(int argc, char* argv[]) {
         TElemType value = 'X';
         printf("█ 将结点 %c 赋值为 %c 后，T = \n", e, value);
         Assign(T, e, value);
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -141,20 +141,20 @@ int main(int argc, char* argv[]) {
         printf("█ 创建子树 c1 ...\n");
         InitBiTree(&c1);
         CreateBiTree(&c1, "TestData_c1.txt");
-        PrintGraph(c1);
+        PrintTree(c1);
         
         printf("█ 创建子树 c2 ...\n");
         InitBiTree(&c2);
         CreateBiTree(&c2, "TestData_c2.txt");
-        PrintGraph(c2);
+        PrintTree(c2);
         
         printf("█ 将子树 c1 插入为二叉树 T 中 %c 结点的右子树 ...\n", p1);
         InsertChild(T, p1, 1, c1);
-        PrintGraph(T);
+        PrintTree(T);
         
         printf("█ 将子树 c2 插入为二叉树 T 中 %c 结点的左子树 ...\n", p2);
         InsertChild(T, p2, 0, c2);
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -166,11 +166,11 @@ int main(int argc, char* argv[]) {
         
         printf("█ 删除二叉树 T 中 %c 结点的右子树 ...\n", p1);
         DeleteChild(T, p1, 1);
-        PrintGraph(T);
+        PrintTree(T);
         
         printf("█ 删除二叉树 T 中 %c 结点的左子树 ...\n", p2);
         DeleteChild(T, p2, 0);
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
diff --git a/CLion/CourseBook/0603_BiTriTree/BiTriTree.c b/CLion/CourseBook/0603_BiTriTree/BiTriTree.c
index fb6eacd..ef77e46 100644
--- a/CLion/CourseBook/0603_BiTriTree/BiTriTree.c
+++ b/CLion/CourseBook/0603_BiTriTree/BiTriTree.c
@@ -602,7 +602,7 @@ static Status PostTraverse(BiTriTree T, Status(Visit)(TElemType)) {
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构，仅限内部测试使用
-void PrintGraph(BiTriTree T) {
+void PrintTree(BiTriTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/CLion/CourseBook/0603_BiTriTree/BiTriTree.h b/CLion/CourseBook/0603_BiTriTree/BiTriTree.h
index ff40846..f68e761 100644
--- a/CLion/CourseBook/0603_BiTriTree/BiTriTree.h
+++ b/CLion/CourseBook/0603_BiTriTree/BiTriTree.h
@@ -201,6 +201,6 @@ static Status PostTraverse(BiTriTree T, Status(Visit)(TElemType));
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构，仅限内部测试使用
-void PrintGraph(BiTriTree T);
+void PrintTree(BiTriTree T);
 
 #endif
diff --git a/CLion/CourseBook/0605_PTree/PTree-main.c b/CLion/CourseBook/0605_PTree/PTree-main.c
index e02b3b8..7113b7f 100644
--- a/CLion/CourseBook/0605_PTree/PTree-main.c
+++ b/CLion/CourseBook/0605_PTree/PTree-main.c
@@ -35,11 +35,11 @@ int main(int argc, char* argv[]) {
     PressEnterToContinue();
     
     
-    printf("████████ PrintGraph \n");
+    printf("████████ PrintTree \n");
     {
         printf("█ 按树的结构打印树 T ...\n");
         printf("█ T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -83,7 +83,7 @@ int main(int argc, char* argv[]) {
         printf("█ 将结点 %c 赋值为 %c ...\n", e, value);
         Assign(&T, e, value);
         printf("█ T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -146,12 +146,12 @@ int main(int argc, char* argv[]) {
         InitTree(&c);
         CreateTree(&c, "TestData_c.txt");
         printf("█ c = \n");
-        PrintGraph(c);
+        PrintTree(c);
         
         printf("█ 将子树 c 插入为树 T 中 %c 结点的第 %d 棵子树 ...\n", p, i);
         InsertChild(&T, p, i, c);
         printf("█ T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -164,7 +164,7 @@ int main(int argc, char* argv[]) {
         printf("█ 删除树 T 中 %c 结点的第 %d 棵子树 ...\n", p, i);
         DeleteChild(&T, p, i);
         printf("█ T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
diff --git a/CLion/CourseBook/0605_PTree/PTree.c b/CLion/CourseBook/0605_PTree/PTree.c
index 2d81e54..6cd4be2 100644
--- a/CLion/CourseBook/0605_PTree/PTree.c
+++ b/CLion/CourseBook/0605_PTree/PTree.c
@@ -1068,7 +1068,7 @@ static void printPos(PTree T, Pos pt[]) {
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构
-void PrintGraph(PTree T) {
+void PrintTree(PTree T) {
     Pos pt[MAX_TREE_SIZE];
     
     // 遇到空树则无需继续计算
diff --git a/CLion/CourseBook/0605_PTree/PTree.h b/CLion/CourseBook/0605_PTree/PTree.h
index 1637a99..107e4a5 100644
--- a/CLion/CourseBook/0605_PTree/PTree.h
+++ b/CLion/CourseBook/0605_PTree/PTree.h
@@ -231,7 +231,7 @@ static void printPos(PTree T, Pos pt[]);
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构
-void PrintGraph(PTree T);
+void PrintTree(PTree T);
 
 // 图形化输出当前结构内部实现
 static void Print(PTree T, Pos pt[], int i);
diff --git a/CLion/CourseBook/0606_CTree/CTree-main.c b/CLion/CourseBook/0606_CTree/CTree-main.c
index 5013653..7ba7b3c 100644
--- a/CLion/CourseBook/0606_CTree/CTree-main.c
+++ b/CLion/CourseBook/0606_CTree/CTree-main.c
@@ -35,11 +35,11 @@ int main(int argc, char* argv[]) {
     PressEnterToContinue();
     
     
-    printf("████████ PrintGraph \n");
+    printf("████████ PrintTree \n");
     {
         printf("█ 按树的结构打印树 T ...\n");
         printf("█ T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -83,7 +83,7 @@ int main(int argc, char* argv[]) {
         printf("█ 将结点 %c 赋值为 %c ...\n", e, value);
         Assign(&T, e, value);
         printf("█ T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -146,12 +146,12 @@ int main(int argc, char* argv[]) {
         InitTree(&c);
         CreateTree(&c, "TestData_c.txt");
         printf("█ c = \n");
-        PrintGraph(c);
+        PrintTree(c);
         
         printf("█ 将子树 c 插入为树 T 中 %c 结点的第 %d 棵子树 ...\n", p, i);
         InsertChild(&T, p, i, c);
         printf("█ T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -164,7 +164,7 @@ int main(int argc, char* argv[]) {
         printf("█ 删除树 T 中 %c 结点的第 %d 棵子树 ...\n", p, i);
         DeleteChild(&T, p, i);
         printf("█ T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
diff --git a/CLion/CourseBook/0606_CTree/CTree.c b/CLion/CourseBook/0606_CTree/CTree.c
index 1a3d6cf..d1d5941 100644
--- a/CLion/CourseBook/0606_CTree/CTree.c
+++ b/CLion/CourseBook/0606_CTree/CTree.c
@@ -1259,7 +1259,7 @@ static void printPos(CTree T, Pos pt[]) {
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构
-void PrintGraph(CTree T) {
+void PrintTree(CTree T) {
     Pos pt[MAX_TREE_SIZE];
     
     // 遇到空树则无需继续计算
diff --git a/CLion/CourseBook/0606_CTree/CTree.h b/CLion/CourseBook/0606_CTree/CTree.h
index 1f5548d..a42b2bf 100644
--- a/CLion/CourseBook/0606_CTree/CTree.h
+++ b/CLion/CourseBook/0606_CTree/CTree.h
@@ -243,7 +243,7 @@ static void printPos(CTree T, Pos pt[]);
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构
-void PrintGraph(CTree T);
+void PrintTree(CTree T);
 
 // 图形化输出当前结构内部实现
 static void Print(CTree T, Pos pt[], int i);
diff --git a/CLion/CourseBook/0607_CSTree/CSTree-main.c b/CLion/CourseBook/0607_CSTree/CSTree-main.c
index e3401c6..527b919 100644
--- a/CLion/CourseBook/0607_CSTree/CSTree-main.c
+++ b/CLion/CourseBook/0607_CSTree/CSTree-main.c
@@ -35,11 +35,11 @@ int main(int argc, char* argv[]) {
     PressEnterToContinue();
     
     
-    printf("████████ PrintGraph \n");
+    printf("████████ PrintTree \n");
     {
         printf("█ 按树的结构打印树 T ...\n");
         printf("█ T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -83,7 +83,7 @@ int main(int argc, char* argv[]) {
         printf("█ 将结点 %c 赋值为 %c ...\n", e, value);
         Assign(T, e, value);
         printf("█ T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -146,12 +146,12 @@ int main(int argc, char* argv[]) {
         InitTree(&c);
         CreateTree(&c, "TestData_c.txt");
         printf("█ c = \n");
-        PrintGraph(c);
+        PrintTree(c);
         
         printf("█ 将子树 c 插入为树 T 中 %c 结点的第 %d 棵子树 ...\n", p, i);
         InsertChild(&T, p, i, c);
         printf("█ T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -164,7 +164,7 @@ int main(int argc, char* argv[]) {
         printf("█ 删除树 T 中 %c 结点的第 %d 棵子树 ...\n", p, i);
         DeleteChild(&T, p, i);
         printf("█ T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
diff --git a/CLion/CourseBook/0607_CSTree/CSTree.c b/CLion/CourseBook/0607_CSTree/CSTree.c
index a7c5232..3979f4b 100644
--- a/CLion/CourseBook/0607_CSTree/CSTree.c
+++ b/CLion/CourseBook/0607_CSTree/CSTree.c
@@ -678,7 +678,7 @@ static Status PostTraverse(CSTree T, Status(Visit)(TElemType)) {
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构
-void PrintGraph(CSTree T) {
+void PrintTree(CSTree T) {
     
     // 遇到空树则无需继续计算
     if(TreeEmpty(T)) {
diff --git a/CLion/CourseBook/0607_CSTree/CSTree.h b/CLion/CourseBook/0607_CSTree/CSTree.h
index 1ff8f62..a8b30f9 100644
--- a/CLion/CourseBook/0607_CSTree/CSTree.h
+++ b/CLion/CourseBook/0607_CSTree/CSTree.h
@@ -196,7 +196,7 @@ static Status PostTraverse(CSTree T, Status(Visit)(TElemType));
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构
-void PrintGraph(CSTree T);
+void PrintTree(CSTree T);
 
 // 图形化输出当前结构内部实现
 static void Print(CSTree T, int row);
diff --git a/CLion/CourseBook/0608_MFSet/MFSet-main.c b/CLion/CourseBook/0608_MFSet/MFSet-main.c
index 2b1b095..0cf6055 100644
--- a/CLion/CourseBook/0608_MFSet/MFSet-main.c
+++ b/CLion/CourseBook/0608_MFSet/MFSet-main.c
@@ -31,10 +31,10 @@ int main(int argc, char* argv[]) {
     PressEnterToContinue();
     
     
-    printf("████████ PrintGraph \n");
+    printf("████████ PrintSet \n");
     {
         printf("█ 输出集合 S ...\n");
-        PrintGraph(S);
+        PrintSet(S);
     }
     PressEnterToContinue();
     
@@ -47,7 +47,7 @@ int main(int argc, char* argv[]) {
         PrintRelation(R1);
 
         printf("█ 输出集合 S ...\n");
-        PrintGraph(S);
+        PrintSet(S);
 
 
         printf("█ 对集合应用二元关系 R2： ");
@@ -55,7 +55,7 @@ int main(int argc, char* argv[]) {
         PrintRelation(R2);
 
         printf("█ 输出集合 S ...\n");
-        PrintGraph(S);
+        PrintSet(S);
     }
     PressEnterToContinue();
     
@@ -68,7 +68,7 @@ int main(int argc, char* argv[]) {
 //        PrintRelation(R1);
 //
 //        printf("█ 输出集合 S ...\n");
-//        PrintGraph(S);
+//        PrintSet(S);
 //
 //
 //        printf("█ 对集合应用二元关系 R2： ");
@@ -76,7 +76,7 @@ int main(int argc, char* argv[]) {
 //        PrintRelation(R2);
 //
 //        printf("█ 输出集合 S ...\n");
-//        PrintGraph(S);
+//        PrintSet(S);
 //    }
 //    PressEnterToContinue();
     
diff --git a/CLion/CourseBook/0608_MFSet/MFSet.c b/CLion/CourseBook/0608_MFSet/MFSet.c
index 3e6cbc3..8ddb7ec 100644
--- a/CLion/CourseBook/0608_MFSet/MFSet.c
+++ b/CLion/CourseBook/0608_MFSet/MFSet.c
@@ -289,7 +289,7 @@ static void relation(Relation* R, FILE* fp) {
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构
-void PrintGraph(MFSet S) {
+void PrintSet(MFSet S) {
     typedef struct Elem {
         int x;
         struct Elem* next;
diff --git a/CLion/CourseBook/0608_MFSet/MFSet.h b/CLion/CourseBook/0608_MFSet/MFSet.h
index e2da255..7f22715 100644
--- a/CLion/CourseBook/0608_MFSet/MFSet.h
+++ b/CLion/CourseBook/0608_MFSet/MFSet.h
@@ -155,7 +155,7 @@ static void relation(Relation* R, FILE* fp);
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前集合
-void PrintGraph(MFSet S);
+void PrintSet(MFSet S);
 
 // 图形化输出树的排列结构，仅限内部测试使用
 static void PrintFramework(MFSet S);
diff --git a/CLion/ExerciseBook/05.28-05.29/05.28-05.29.c b/CLion/ExerciseBook/05.28-05.29/05.28-05.29.c
index 7a00901..a44e583 100644
--- a/CLion/ExerciseBook/05.28-05.29/05.28-05.29.c
+++ b/CLion/ExerciseBook/05.28-05.29/05.28-05.29.c
@@ -41,23 +41,23 @@ int main(int argc, char* argv[]) {
     printf("创建三元多项式...\n");
     CreateMPList(&P, p, "zyx");
     printf("P = ");
-    PrintGraph(P);
+    PrintMPList(P);
     CreateMPList(&Q, q, "zyx");
     printf("Q = ");
-    PrintGraph(Q);
+    PrintMPList(Q);
     
     // 求第一元的偏导数
     printf("P' = ");
     Algo_5_28(P, &PD);
-    PrintGraph(PD);
+    PrintMPList(PD);
     printf("Q' = ");
     Algo_5_28(Q, &QD);
-    PrintGraph(QD);
+    PrintMPList(QD);
 
     // 多项式加法
     printf("R = ");
     Algo_5_29(P, Q, &R);
-    PrintGraph(R);
+    PrintMPList(R);
 }
 
 
diff --git a/CLion/ExerciseBook/05.28-05.29/MPList.c b/CLion/ExerciseBook/05.28-05.29/MPList.c
index bccdc6b..507eb29 100644
--- a/CLion/ExerciseBook/05.28-05.29/MPList.c
+++ b/CLion/ExerciseBook/05.28-05.29/MPList.c
@@ -111,7 +111,7 @@ static Status Create(MPList* P, char* S) {
  *
  * 带括号输出m元多项P。
  */
-void PrintGraph(MPList P) {
+void PrintMPList(MPList P) {
     if(P == NULL) {
         printf("\n");
         return;
diff --git a/CLion/ExerciseBook/05.28-05.29/MPList.h b/CLion/ExerciseBook/05.28-05.29/MPList.h
index 1ca2056..753c4ae 100644
--- a/CLion/ExerciseBook/05.28-05.29/MPList.h
+++ b/CLion/ExerciseBook/05.28-05.29/MPList.h
@@ -72,7 +72,7 @@ static Status Create(MPList* P, char* S);
  *
  * 带括号输出m元多项P。
  */
-void PrintGraph(MPList P);
+void PrintMPList(MPList P);
 
 /*
  * 图形化输出的内部实现
diff --git a/CLion/ExerciseBook/05.30.1/05.30.1.c b/CLion/ExerciseBook/05.30.1/05.30.1.c
index 527fc7b..d682254 100644
--- a/CLion/ExerciseBook/05.30.1/05.30.1.c
+++ b/CLion/ExerciseBook/05.30.1/05.30.1.c
@@ -15,7 +15,7 @@ int main(int argc, char* argv[]) {
     StrAssign(S, s);
     CreateGList(&L, S);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     printf("广义表深度为： %d\n", Algo_5_30_1(L));
     
diff --git a/CLion/ExerciseBook/05.30.1/GList-HT.c b/CLion/ExerciseBook/05.30.1/GList-HT.c
index ddf2766..9b8e3cc 100644
--- a/CLion/ExerciseBook/05.30.1/GList-HT.c
+++ b/CLion/ExerciseBook/05.30.1/GList-HT.c
@@ -335,7 +335,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * 带括号输出广义表L。
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L, Head);
     printf("\n");
 }
diff --git a/CLion/ExerciseBook/05.30.1/GList-HT.h b/CLion/ExerciseBook/05.30.1/GList-HT.h
index 07c0df2..12371eb 100644
--- a/CLion/ExerciseBook/05.30.1/GList-HT.h
+++ b/CLion/ExerciseBook/05.30.1/GList-HT.h
@@ -143,7 +143,7 @@ void Traverse(GList L, void (Visit)(AtomType));
  *
  * 带括号输出广义表L。
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * 图形化输出的内部实现，mark是图形化输出标记。
diff --git a/CLion/ExerciseBook/05.30.2/05.30.2.c b/CLion/ExerciseBook/05.30.2/05.30.2.c
index 8ad12c9..36eceff 100644
--- a/CLion/ExerciseBook/05.30.2/05.30.2.c
+++ b/CLion/ExerciseBook/05.30.2/05.30.2.c
@@ -15,7 +15,7 @@ int main(int argc, char* argv[]) {
     StrAssign(S, s);
     CreateGList(&L, S);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     printf("广义表深度为： %d\n", Algo_5_30_2(L));
     
diff --git a/CLion/ExerciseBook/05.30.2/GList-E.c b/CLion/ExerciseBook/05.30.2/GList-E.c
index d994024..a7ca33a 100644
--- a/CLion/ExerciseBook/05.30.2/GList-E.c
+++ b/CLion/ExerciseBook/05.30.2/GList-E.c
@@ -370,7 +370,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * 带括号输出广义表L。
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L);
     printf("\n");
 }
diff --git a/CLion/ExerciseBook/05.30.2/GList-E.h b/CLion/ExerciseBook/05.30.2/GList-E.h
index 5e5b625..aa58fa0 100644
--- a/CLion/ExerciseBook/05.30.2/GList-E.h
+++ b/CLion/ExerciseBook/05.30.2/GList-E.h
@@ -126,7 +126,7 @@ void Traverse(GList L, void(Visit)(AtomType));
  *
  * 带括号输出广义表L。
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * 图形化输出的内部实现。
diff --git a/CLion/ExerciseBook/05.31/05.31.c b/CLion/ExerciseBook/05.31/05.31.c
index c9ece2d..a097a0f 100644
--- a/CLion/ExerciseBook/05.31/05.31.c
+++ b/CLion/ExerciseBook/05.31/05.31.c
@@ -21,12 +21,12 @@ int main(int argc, char* argv[]) {
     StrAssign(S, s);
     CreateGList(&L, S);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     printf("复制广义表到 L 到 T...\n");
     Algo_5_31(&T, L);
     printf("T = ");
-    PrintGraph(T);
+    PrintGList(T);
     
     return 0;
 }
diff --git a/CLion/ExerciseBook/05.31/GList-E.c b/CLion/ExerciseBook/05.31/GList-E.c
index d994024..a7ca33a 100644
--- a/CLion/ExerciseBook/05.31/GList-E.c
+++ b/CLion/ExerciseBook/05.31/GList-E.c
@@ -370,7 +370,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * 带括号输出广义表L。
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L);
     printf("\n");
 }
diff --git a/CLion/ExerciseBook/05.31/GList-E.h b/CLion/ExerciseBook/05.31/GList-E.h
index 5e5b625..aa58fa0 100644
--- a/CLion/ExerciseBook/05.31/GList-E.h
+++ b/CLion/ExerciseBook/05.31/GList-E.h
@@ -126,7 +126,7 @@ void Traverse(GList L, void(Visit)(AtomType));
  *
  * 带括号输出广义表L。
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * 图形化输出的内部实现。
diff --git a/CLion/ExerciseBook/05.32.1/05.32.1.c b/CLion/ExerciseBook/05.32.1/05.32.1.c
index 4f3b192..5a0ac97 100644
--- a/CLion/ExerciseBook/05.32.1/05.32.1.c
+++ b/CLion/ExerciseBook/05.32.1/05.32.1.c
@@ -21,9 +21,9 @@ int main(int argc, char* argv[]) {
     StrAssign(Sb, b);
     CreateGList(&B, Sb);
     printf("A = ");
-    PrintGraph(A);
+    PrintGList(A);
     printf("B = ");
-    PrintGraph(B);
+    PrintGList(B);
     
     Algo_5_32_1(A, B) ? printf("两广义表相等！\n") : printf("两广义表不相等！！\n");
     
diff --git a/CLion/ExerciseBook/05.32.1/GList-HT.c b/CLion/ExerciseBook/05.32.1/GList-HT.c
index ddf2766..9b8e3cc 100644
--- a/CLion/ExerciseBook/05.32.1/GList-HT.c
+++ b/CLion/ExerciseBook/05.32.1/GList-HT.c
@@ -335,7 +335,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * 带括号输出广义表L。
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L, Head);
     printf("\n");
 }
diff --git a/CLion/ExerciseBook/05.32.1/GList-HT.h b/CLion/ExerciseBook/05.32.1/GList-HT.h
index 07c0df2..12371eb 100644
--- a/CLion/ExerciseBook/05.32.1/GList-HT.h
+++ b/CLion/ExerciseBook/05.32.1/GList-HT.h
@@ -143,7 +143,7 @@ void Traverse(GList L, void (Visit)(AtomType));
  *
  * 带括号输出广义表L。
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * 图形化输出的内部实现，mark是图形化输出标记。
diff --git a/CLion/ExerciseBook/05.32.2/05.32.2.c b/CLion/ExerciseBook/05.32.2/05.32.2.c
index 8b0377b..a8d207c 100644
--- a/CLion/ExerciseBook/05.32.2/05.32.2.c
+++ b/CLion/ExerciseBook/05.32.2/05.32.2.c
@@ -21,9 +21,9 @@ int main(int argc, char* argv[]) {
     StrAssign(Sb, b);
     CreateGList(&B, Sb);
     printf("A = ");
-    PrintGraph(A);
+    PrintGList(A);
     printf("B = ");
-    PrintGraph(B);
+    PrintGList(B);
     
     Algo_5_32_2(A, B) ? printf("两广义表相等！\n") : printf("两广义表不相等！！\n");
     
diff --git a/CLion/ExerciseBook/05.32.2/GList-E.c b/CLion/ExerciseBook/05.32.2/GList-E.c
index d994024..a7ca33a 100644
--- a/CLion/ExerciseBook/05.32.2/GList-E.c
+++ b/CLion/ExerciseBook/05.32.2/GList-E.c
@@ -370,7 +370,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * 带括号输出广义表L。
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L);
     printf("\n");
 }
diff --git a/CLion/ExerciseBook/05.32.2/GList-E.h b/CLion/ExerciseBook/05.32.2/GList-E.h
index 5e5b625..aa58fa0 100644
--- a/CLion/ExerciseBook/05.32.2/GList-E.h
+++ b/CLion/ExerciseBook/05.32.2/GList-E.h
@@ -126,7 +126,7 @@ void Traverse(GList L, void(Visit)(AtomType));
  *
  * 带括号输出广义表L。
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * 图形化输出的内部实现。
diff --git a/CLion/ExerciseBook/05.33.1/05.33.1.c b/CLion/ExerciseBook/05.33.1/05.33.1.c
index a35f1e4..b34f57e 100644
--- a/CLion/ExerciseBook/05.33.1/05.33.1.c
+++ b/CLion/ExerciseBook/05.33.1/05.33.1.c
@@ -17,7 +17,7 @@ int main(int argc, char* argv[]) {
     StrAssign(S, s);
     CreateGList(&L, S);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     Algo_5_33_1(L, 0);
     
diff --git a/CLion/ExerciseBook/05.33.1/GList-HT.c b/CLion/ExerciseBook/05.33.1/GList-HT.c
index ddf2766..9b8e3cc 100644
--- a/CLion/ExerciseBook/05.33.1/GList-HT.c
+++ b/CLion/ExerciseBook/05.33.1/GList-HT.c
@@ -335,7 +335,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * 带括号输出广义表L。
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L, Head);
     printf("\n");
 }
diff --git a/CLion/ExerciseBook/05.33.1/GList-HT.h b/CLion/ExerciseBook/05.33.1/GList-HT.h
index 07c0df2..12371eb 100644
--- a/CLion/ExerciseBook/05.33.1/GList-HT.h
+++ b/CLion/ExerciseBook/05.33.1/GList-HT.h
@@ -143,7 +143,7 @@ void Traverse(GList L, void (Visit)(AtomType));
  *
  * 带括号输出广义表L。
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * 图形化输出的内部实现，mark是图形化输出标记。
diff --git a/CLion/ExerciseBook/05.33.2/05.33.2.c b/CLion/ExerciseBook/05.33.2/05.33.2.c
index 68ceea4..9addef2 100644
--- a/CLion/ExerciseBook/05.33.2/05.33.2.c
+++ b/CLion/ExerciseBook/05.33.2/05.33.2.c
@@ -17,7 +17,7 @@ int main(int argc, char* argv[]) {
     StrAssign(S, s);
     CreateGList(&L, S);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     Algo_5_33_2(L, 0);
     
diff --git a/CLion/ExerciseBook/05.33.2/GList-E.c b/CLion/ExerciseBook/05.33.2/GList-E.c
index d994024..a7ca33a 100644
--- a/CLion/ExerciseBook/05.33.2/GList-E.c
+++ b/CLion/ExerciseBook/05.33.2/GList-E.c
@@ -370,7 +370,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * 带括号输出广义表L。
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L);
     printf("\n");
 }
diff --git a/CLion/ExerciseBook/05.33.2/GList-E.h b/CLion/ExerciseBook/05.33.2/GList-E.h
index 5e5b625..aa58fa0 100644
--- a/CLion/ExerciseBook/05.33.2/GList-E.h
+++ b/CLion/ExerciseBook/05.33.2/GList-E.h
@@ -126,7 +126,7 @@ void Traverse(GList L, void(Visit)(AtomType));
  *
  * 带括号输出广义表L。
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * 图形化输出的内部实现。
diff --git a/CLion/ExerciseBook/05.34.1/05.34.1.c b/CLion/ExerciseBook/05.34.1/05.34.1.c
index af342c8..f644444 100644
--- a/CLion/ExerciseBook/05.34.1/05.34.1.c
+++ b/CLion/ExerciseBook/05.34.1/05.34.1.c
@@ -18,12 +18,12 @@ int main(int argc, char* argv[]) {
     StrAssign(S, s);
     CreateGList(&L, S);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     printf("逆置广义表...\n");
     Algo_5_34_1(&L);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     return 0;
 }
diff --git a/CLion/ExerciseBook/05.34.1/GList-HT.c b/CLion/ExerciseBook/05.34.1/GList-HT.c
index ddf2766..9b8e3cc 100644
--- a/CLion/ExerciseBook/05.34.1/GList-HT.c
+++ b/CLion/ExerciseBook/05.34.1/GList-HT.c
@@ -335,7 +335,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * 带括号输出广义表L。
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L, Head);
     printf("\n");
 }
diff --git a/CLion/ExerciseBook/05.34.1/GList-HT.h b/CLion/ExerciseBook/05.34.1/GList-HT.h
index 07c0df2..12371eb 100644
--- a/CLion/ExerciseBook/05.34.1/GList-HT.h
+++ b/CLion/ExerciseBook/05.34.1/GList-HT.h
@@ -143,7 +143,7 @@ void Traverse(GList L, void (Visit)(AtomType));
  *
  * 带括号输出广义表L。
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * 图形化输出的内部实现，mark是图形化输出标记。
diff --git a/CLion/ExerciseBook/05.34.2/05.34.2.c b/CLion/ExerciseBook/05.34.2/05.34.2.c
index 0dfdf8e..817b729 100644
--- a/CLion/ExerciseBook/05.34.2/05.34.2.c
+++ b/CLion/ExerciseBook/05.34.2/05.34.2.c
@@ -18,12 +18,12 @@ int main(int argc, char* argv[]) {
     StrAssign(S, s);
     CreateGList(&L, S);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     printf("逆置广义表...\n");
     Algo_5_34_2(&L);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     return 0;
 }
diff --git a/CLion/ExerciseBook/05.34.2/GList-E.c b/CLion/ExerciseBook/05.34.2/GList-E.c
index d994024..a7ca33a 100644
--- a/CLion/ExerciseBook/05.34.2/GList-E.c
+++ b/CLion/ExerciseBook/05.34.2/GList-E.c
@@ -370,7 +370,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * 带括号输出广义表L。
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L);
     printf("\n");
 }
diff --git a/CLion/ExerciseBook/05.34.2/GList-E.h b/CLion/ExerciseBook/05.34.2/GList-E.h
index 5e5b625..aa58fa0 100644
--- a/CLion/ExerciseBook/05.34.2/GList-E.h
+++ b/CLion/ExerciseBook/05.34.2/GList-E.h
@@ -126,7 +126,7 @@ void Traverse(GList L, void(Visit)(AtomType));
  *
  * 带括号输出广义表L。
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * 图形化输出的内部实现。
diff --git a/CLion/ExerciseBook/05.35-05.36/05.35-05.36.c b/CLion/ExerciseBook/05.35-05.36/05.35-05.36.c
index 313ba72..8b3a449 100644
--- a/CLion/ExerciseBook/05.35-05.36/05.35-05.36.c
+++ b/CLion/ExerciseBook/05.35-05.36/05.35-05.36.c
@@ -41,5 +41,5 @@ Status Algo_5_35(GList* L, SString S) {
  * 带括号输出广义表L，这里将"( )"定义为广义表为空的状态。
  */
 void Algo_5_36(GList L) {
-    PrintGraph(L);
+    PrintGList(L);
 }
diff --git a/CLion/ExerciseBook/05.35-05.36/GList.c b/CLion/ExerciseBook/05.35-05.36/GList.c
index 967762f..ff397b5 100644
--- a/CLion/ExerciseBook/05.35-05.36/GList.c
+++ b/CLion/ExerciseBook/05.35-05.36/GList.c
@@ -96,7 +96,7 @@ Status CreateGList(GList* L, SString S) {
  *【注】
  * 这里将"( )"定义为广义表为空的状态。
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L, Head);
     printf("\n");
 }
diff --git a/CLion/ExerciseBook/05.35-05.36/GList.h b/CLion/ExerciseBook/05.35-05.36/GList.h
index 68e960a..9d5ae88 100644
--- a/CLion/ExerciseBook/05.35-05.36/GList.h
+++ b/CLion/ExerciseBook/05.35-05.36/GList.h
@@ -61,7 +61,7 @@ Status CreateGList(GList* L, SString S);
  *
  * 带括号输出广义表L。
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * 图形化输出的内部实现，mark是图形化输出标记。
diff --git a/CLion/ExerciseBook/05.37.1/05.37.1.c b/CLion/ExerciseBook/05.37.1/05.37.1.c
index e1a14d1..ae9e904 100644
--- a/CLion/ExerciseBook/05.37.1/05.37.1.c
+++ b/CLion/ExerciseBook/05.37.1/05.37.1.c
@@ -17,12 +17,12 @@ int main(int argc, char* argv[]) {
     StrAssign(S, s);
     CreateGList(&L, S);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     printf("删除 L 中的元素 'b' ...\n");
     Algo_5_37_1(&L, 'b');
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     return 0;
 }
diff --git a/CLion/ExerciseBook/05.37.1/GList-HT.c b/CLion/ExerciseBook/05.37.1/GList-HT.c
index ddf2766..9b8e3cc 100644
--- a/CLion/ExerciseBook/05.37.1/GList-HT.c
+++ b/CLion/ExerciseBook/05.37.1/GList-HT.c
@@ -335,7 +335,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * 带括号输出广义表L。
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L, Head);
     printf("\n");
 }
diff --git a/CLion/ExerciseBook/05.37.1/GList-HT.h b/CLion/ExerciseBook/05.37.1/GList-HT.h
index 07c0df2..12371eb 100644
--- a/CLion/ExerciseBook/05.37.1/GList-HT.h
+++ b/CLion/ExerciseBook/05.37.1/GList-HT.h
@@ -143,7 +143,7 @@ void Traverse(GList L, void (Visit)(AtomType));
  *
  * 带括号输出广义表L。
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * 图形化输出的内部实现，mark是图形化输出标记。
diff --git a/CLion/ExerciseBook/05.37.2/05.37.2.c b/CLion/ExerciseBook/05.37.2/05.37.2.c
index 9fb53fd..1036585 100644
--- a/CLion/ExerciseBook/05.37.2/05.37.2.c
+++ b/CLion/ExerciseBook/05.37.2/05.37.2.c
@@ -18,12 +18,12 @@ int main(int argc, char* argv[]) {
     StrAssign(S, s);
     CreateGList(&L, S);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     printf("删除 L 中的元素 'b' ...\n");
     Algo_5_37_2(&L, 'b');
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     return 0;
 }
diff --git a/CLion/ExerciseBook/05.37.2/GList-E.c b/CLion/ExerciseBook/05.37.2/GList-E.c
index d994024..a7ca33a 100644
--- a/CLion/ExerciseBook/05.37.2/GList-E.c
+++ b/CLion/ExerciseBook/05.37.2/GList-E.c
@@ -370,7 +370,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * 带括号输出广义表L。
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L);
     printf("\n");
 }
diff --git a/CLion/ExerciseBook/05.37.2/GList-E.h b/CLion/ExerciseBook/05.37.2/GList-E.h
index 5e5b625..aa58fa0 100644
--- a/CLion/ExerciseBook/05.37.2/GList-E.h
+++ b/CLion/ExerciseBook/05.37.2/GList-E.h
@@ -126,7 +126,7 @@ void Traverse(GList L, void(Visit)(AtomType));
  *
  * 带括号输出广义表L。
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * 图形化输出的内部实现。
diff --git a/CLion/ExerciseBook/05.38.1/05.38.1.c b/CLion/ExerciseBook/05.38.1/05.38.1.c
index b6eb09e..7d38ba4 100644
--- a/CLion/ExerciseBook/05.38.1/05.38.1.c
+++ b/CLion/ExerciseBook/05.38.1/05.38.1.c
@@ -17,7 +17,7 @@ int main(int argc, char* argv[]) {
     StrAssign(S, s);
     CreateGList(&L, S);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     printf("广义表第 2 层的原子项为：");
     Algo_5_38_1(L, 0, 2);
diff --git a/CLion/ExerciseBook/05.38.1/GList-HT.c b/CLion/ExerciseBook/05.38.1/GList-HT.c
index ddf2766..9b8e3cc 100644
--- a/CLion/ExerciseBook/05.38.1/GList-HT.c
+++ b/CLion/ExerciseBook/05.38.1/GList-HT.c
@@ -335,7 +335,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * 带括号输出广义表L。
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L, Head);
     printf("\n");
 }
diff --git a/CLion/ExerciseBook/05.38.1/GList-HT.h b/CLion/ExerciseBook/05.38.1/GList-HT.h
index 07c0df2..12371eb 100644
--- a/CLion/ExerciseBook/05.38.1/GList-HT.h
+++ b/CLion/ExerciseBook/05.38.1/GList-HT.h
@@ -143,7 +143,7 @@ void Traverse(GList L, void (Visit)(AtomType));
  *
  * 带括号输出广义表L。
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * 图形化输出的内部实现，mark是图形化输出标记。
diff --git a/CLion/ExerciseBook/05.38.2/05.38.2.c b/CLion/ExerciseBook/05.38.2/05.38.2.c
index 9e72692..99c7352 100644
--- a/CLion/ExerciseBook/05.38.2/05.38.2.c
+++ b/CLion/ExerciseBook/05.38.2/05.38.2.c
@@ -17,7 +17,7 @@ int main(int argc, char* argv[]) {
     StrAssign(S, s);
     CreateGList(&L, S);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     printf("广义表第 2 层的原子项为：");
     Algo_5_38_2(L, 0, 2);
diff --git a/CLion/ExerciseBook/05.38.2/GList-E.c b/CLion/ExerciseBook/05.38.2/GList-E.c
index d994024..a7ca33a 100644
--- a/CLion/ExerciseBook/05.38.2/GList-E.c
+++ b/CLion/ExerciseBook/05.38.2/GList-E.c
@@ -370,7 +370,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * 带括号输出广义表L。
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L);
     printf("\n");
 }
diff --git a/CLion/ExerciseBook/05.38.2/GList-E.h b/CLion/ExerciseBook/05.38.2/GList-E.h
index 5e5b625..aa58fa0 100644
--- a/CLion/ExerciseBook/05.38.2/GList-E.h
+++ b/CLion/ExerciseBook/05.38.2/GList-E.h
@@ -126,7 +126,7 @@ void Traverse(GList L, void(Visit)(AtomType));
  *
  * 带括号输出广义表L。
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * 图形化输出的内部实现。
diff --git a/CLion/ExerciseBook/06.36/06.36.c b/CLion/ExerciseBook/06.36/06.36.c
index cd2e140..3a08f7d 100644
--- a/CLion/ExerciseBook/06.36/06.36.c
+++ b/CLion/ExerciseBook/06.36/06.36.c
@@ -13,17 +13,17 @@ int main(int argc, char* argv[]) {
     
     printf("创建二叉树 B1 ：...\n");
     CreateBiTree(&B1, "TestData_B1.txt");
-    PrintGraph(B1);
+    PrintTree(B1);
     printf("\n");
     
     printf("创建二叉树 B2 ：...\n");
     CreateBiTree(&B2, "TestData_B2.txt");
-    PrintGraph(B2);
+    PrintTree(B2);
     printf("\n");
     
     printf("创建二叉树 B3 ：...\n");
     CreateBiTree(&B3, "TestData_B3.txt");
-    PrintGraph(B3);
+    PrintTree(B3);
     printf("\n");
     
     if(Algo_6_36(B1, B2) == TRUE) {
diff --git a/CLion/ExerciseBook/06.36/BiTree.c b/CLion/ExerciseBook/06.36/BiTree.c
index 1696ecc..447d3ac 100644
--- a/CLion/ExerciseBook/06.36/BiTree.c
+++ b/CLion/ExerciseBook/06.36/BiTree.c
@@ -107,7 +107,7 @@ static void CreateTree(BiTree* T, FILE* fp) {
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构，仅限内部测试使用
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/CLion/ExerciseBook/06.36/BiTree.h b/CLion/ExerciseBook/06.36/BiTree.h
index 2169f83..1ee5b48 100644
--- a/CLion/ExerciseBook/06.36/BiTree.h
+++ b/CLion/ExerciseBook/06.36/BiTree.h
@@ -71,6 +71,6 @@ static void CreateTree(BiTree* T, FILE* fp);
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构，仅限内部测试使用
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/CLion/ExerciseBook/06.37-06.38/06.37-06.38.c b/CLion/ExerciseBook/06.37-06.38/06.37-06.38.c
index 74c3dd2..6a5f8b7 100644
--- a/CLion/ExerciseBook/06.37-06.38/06.37-06.38.c
+++ b/CLion/ExerciseBook/06.37-06.38/06.37-06.38.c
@@ -19,7 +19,7 @@ int main(int argc, char* argv[]) {
     
     printf("创建二叉树 T ：...\n");
     CreateBiTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("███题 6.37 验证...███\n");
diff --git a/CLion/ExerciseBook/06.37-06.38/BiTree.c b/CLion/ExerciseBook/06.37-06.38/BiTree.c
index 1696ecc..447d3ac 100644
--- a/CLion/ExerciseBook/06.37-06.38/BiTree.c
+++ b/CLion/ExerciseBook/06.37-06.38/BiTree.c
@@ -107,7 +107,7 @@ static void CreateTree(BiTree* T, FILE* fp) {
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构，仅限内部测试使用
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/CLion/ExerciseBook/06.37-06.38/BiTree.h b/CLion/ExerciseBook/06.37-06.38/BiTree.h
index 2169f83..1ee5b48 100644
--- a/CLion/ExerciseBook/06.37-06.38/BiTree.h
+++ b/CLion/ExerciseBook/06.37-06.38/BiTree.h
@@ -71,6 +71,6 @@ static void CreateTree(BiTree* T, FILE* fp);
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构，仅限内部测试使用
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/CLion/ExerciseBook/06.41-06.49/06.41-06.49.c b/CLion/ExerciseBook/06.41-06.49/06.41-06.49.c
index b5e5243..4e9f496 100644
--- a/CLion/ExerciseBook/06.41-06.49/06.41-06.49.c
+++ b/CLion/ExerciseBook/06.41-06.49/06.41-06.49.c
@@ -66,7 +66,7 @@ int main(int argc, char* argv[]) {
     printf("创建二叉树 T ...\n");
     InitBiTree(&T);
     CreateBiTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("███题 6.41 验证...███\n");
@@ -94,7 +94,7 @@ int main(int argc, char* argv[]) {
     {
         printf("交换二叉树左右子树后二叉树变为：\n");
         Algo_6_43(T);
-        PrintGraph(T);
+        PrintTree(T);
         printf("\n");
     }
     
@@ -112,7 +112,7 @@ int main(int argc, char* argv[]) {
         
         printf("删除子树 %c 后，二叉树为：\n", x);
         if(Algo_6_45(&T, x)) {
-            PrintGraph(T);
+            PrintTree(T);
         }
         printf("\n");
     }
@@ -123,7 +123,7 @@ int main(int argc, char* argv[]) {
         
         printf("复制 T 到 Tx 后，二叉树Tx为：\n");
         Algo_6_46(T, &Tx);
-        PrintGraph(Tx);
+        PrintTree(Tx);
         printf("\n");
     }
     
diff --git a/CLion/ExerciseBook/06.41-06.49/BiTree.c b/CLion/ExerciseBook/06.41-06.49/BiTree.c
index 23d4976..6c2324d 100644
--- a/CLion/ExerciseBook/06.41-06.49/BiTree.c
+++ b/CLion/ExerciseBook/06.41-06.49/BiTree.c
@@ -149,7 +149,7 @@ static void CreateTree(BiTree* T, FILE* fp) {
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构，仅限内部测试使用
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/CLion/ExerciseBook/06.41-06.49/BiTree.h b/CLion/ExerciseBook/06.41-06.49/BiTree.h
index 5bd67ff..6624ab2 100644
--- a/CLion/ExerciseBook/06.41-06.49/BiTree.h
+++ b/CLion/ExerciseBook/06.41-06.49/BiTree.h
@@ -85,6 +85,6 @@ static void CreateTree(BiTree* T, FILE* fp);
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构，仅限内部测试使用
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/CLion/ExerciseBook/06.50/06.50.c b/CLion/ExerciseBook/06.50/06.50.c
index 88318ed..c3b95ac 100644
--- a/CLion/ExerciseBook/06.50/06.50.c
+++ b/CLion/ExerciseBook/06.50/06.50.c
@@ -22,7 +22,7 @@ int main(int argc, char* argv[]) {
     printf("\n");
     
     printf("二叉树T为：\n");
-    PrintGraph(T);
+    PrintTree(T);
     
     return 0;
 }
diff --git a/CLion/ExerciseBook/06.50/BiTree.c b/CLion/ExerciseBook/06.50/BiTree.c
index 6dc871b..0f68544 100644
--- a/CLion/ExerciseBook/06.50/BiTree.c
+++ b/CLion/ExerciseBook/06.50/BiTree.c
@@ -50,7 +50,7 @@ int BiTreeDepth(BiTree T) {
 }
 
 // 以图形化形式输出当前结构，仅限内部测试使用
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/CLion/ExerciseBook/06.50/BiTree.h b/CLion/ExerciseBook/06.50/BiTree.h
index ee19645..ac75fb8 100644
--- a/CLion/ExerciseBook/06.50/BiTree.h
+++ b/CLion/ExerciseBook/06.50/BiTree.h
@@ -49,6 +49,6 @@ Status BiTreeEmpty(BiTree T);
 int BiTreeDepth(BiTree T);
 
 // 以图形化形式输出当前结构，仅限内部测试使用
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/CLion/ExerciseBook/06.51/06.51.c b/CLion/ExerciseBook/06.51/06.51.c
index 112f619..5b3809d 100644
--- a/CLion/ExerciseBook/06.51/06.51.c
+++ b/CLion/ExerciseBook/06.51/06.51.c
@@ -20,7 +20,7 @@ int main(int argc, char* argv[]) {
     printf("创建二叉树（先序序列）T...\n");
     InitBiTree(&T);
     CreateBiTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("输出算术表达式：");
diff --git a/CLion/ExerciseBook/06.51/BiTree.c b/CLion/ExerciseBook/06.51/BiTree.c
index 23d4976..6c2324d 100644
--- a/CLion/ExerciseBook/06.51/BiTree.c
+++ b/CLion/ExerciseBook/06.51/BiTree.c
@@ -149,7 +149,7 @@ static void CreateTree(BiTree* T, FILE* fp) {
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构，仅限内部测试使用
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/CLion/ExerciseBook/06.51/BiTree.h b/CLion/ExerciseBook/06.51/BiTree.h
index 5bd67ff..6624ab2 100644
--- a/CLion/ExerciseBook/06.51/BiTree.h
+++ b/CLion/ExerciseBook/06.51/BiTree.h
@@ -85,6 +85,6 @@ static void CreateTree(BiTree* T, FILE* fp);
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构，仅限内部测试使用
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/CLion/ExerciseBook/06.52/06.52.c b/CLion/ExerciseBook/06.52/06.52.c
index 5ac0df3..d5c6c26 100644
--- a/CLion/ExerciseBook/06.52/06.52.c
+++ b/CLion/ExerciseBook/06.52/06.52.c
@@ -17,7 +17,7 @@ int main(int argc, char* argv[]) {
     printf("创建二叉树（先序序列）T...\n");
     InitBiTree(&T);
     CreateBiTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("树的繁茂度为： %d", Algo_6_52(T));
diff --git a/CLion/ExerciseBook/06.52/BiTree.c b/CLion/ExerciseBook/06.52/BiTree.c
index 23d4976..6c2324d 100644
--- a/CLion/ExerciseBook/06.52/BiTree.c
+++ b/CLion/ExerciseBook/06.52/BiTree.c
@@ -149,7 +149,7 @@ static void CreateTree(BiTree* T, FILE* fp) {
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构，仅限内部测试使用
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/CLion/ExerciseBook/06.52/BiTree.h b/CLion/ExerciseBook/06.52/BiTree.h
index 5bd67ff..6624ab2 100644
--- a/CLion/ExerciseBook/06.52/BiTree.h
+++ b/CLion/ExerciseBook/06.52/BiTree.h
@@ -85,6 +85,6 @@ static void CreateTree(BiTree* T, FILE* fp);
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构，仅限内部测试使用
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/CLion/ExerciseBook/06.53/06.53.c b/CLion/ExerciseBook/06.53/06.53.c
index 195be76..df5c6d1 100644
--- a/CLion/ExerciseBook/06.53/06.53.c
+++ b/CLion/ExerciseBook/06.53/06.53.c
@@ -18,7 +18,7 @@ int main(int argc, char* argv[]) {
     printf("创建二叉树（先序序列）T...\n");
     InitBiTree(&T);
     CreateBiTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("输出根结点到叶子结点最长路径中最靠左的一条：");
diff --git a/CLion/ExerciseBook/06.53/BiTree.c b/CLion/ExerciseBook/06.53/BiTree.c
index 23d4976..6c2324d 100644
--- a/CLion/ExerciseBook/06.53/BiTree.c
+++ b/CLion/ExerciseBook/06.53/BiTree.c
@@ -149,7 +149,7 @@ static void CreateTree(BiTree* T, FILE* fp) {
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构，仅限内部测试使用
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/CLion/ExerciseBook/06.53/BiTree.h b/CLion/ExerciseBook/06.53/BiTree.h
index 5bd67ff..6624ab2 100644
--- a/CLion/ExerciseBook/06.53/BiTree.h
+++ b/CLion/ExerciseBook/06.53/BiTree.h
@@ -85,6 +85,6 @@ static void CreateTree(BiTree* T, FILE* fp);
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构，仅限内部测试使用
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/CLion/ExerciseBook/06.54/06.54.c b/CLion/ExerciseBook/06.54/06.54.c
index f640b56..ae4ae47 100644
--- a/CLion/ExerciseBook/06.54/06.54.c
+++ b/CLion/ExerciseBook/06.54/06.54.c
@@ -17,7 +17,7 @@ int main(int argc, char* argv[]) {
    
     printf("创建二叉树（层序序列）...\n");
     Algo_6_54(&T, sa);
-    PrintGraph(T);
+    PrintTree(T);
     
     return 0;
 }
diff --git a/CLion/ExerciseBook/06.54/BiTree.c b/CLion/ExerciseBook/06.54/BiTree.c
index 6dc871b..0f68544 100644
--- a/CLion/ExerciseBook/06.54/BiTree.c
+++ b/CLion/ExerciseBook/06.54/BiTree.c
@@ -50,7 +50,7 @@ int BiTreeDepth(BiTree T) {
 }
 
 // 以图形化形式输出当前结构，仅限内部测试使用
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/CLion/ExerciseBook/06.54/BiTree.h b/CLion/ExerciseBook/06.54/BiTree.h
index ee19645..ac75fb8 100644
--- a/CLion/ExerciseBook/06.54/BiTree.h
+++ b/CLion/ExerciseBook/06.54/BiTree.h
@@ -49,6 +49,6 @@ Status BiTreeEmpty(BiTree T);
 int BiTreeDepth(BiTree T);
 
 // 以图形化形式输出当前结构，仅限内部测试使用
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/CLion/ExerciseBook/06.55/06.55.c b/CLion/ExerciseBook/06.55/06.55.c
index 9f4fc76..afffee8 100644
--- a/CLion/ExerciseBook/06.55/06.55.c
+++ b/CLion/ExerciseBook/06.55/06.55.c
@@ -1,6 +1,5 @@
 #include <stdio.h>
 #include <stdlib.h>     // 提供malloc、realloc、free、exit原型
-#include "Status.h"     //**▲01 绪论**//
 #include "BiTree.h"     //**▲06 树和二叉树**//
 
 /*
@@ -18,7 +17,7 @@ int main(int argc, char* argv[]) {
     printf("创建二叉树（先序序列）T...\n");
     InitBiTree(&T);
     CreateBiTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("先序输出二叉树结点值及其相应的子孙数目：\n");
diff --git a/CLion/ExerciseBook/06.55/BiTree.c b/CLion/ExerciseBook/06.55/BiTree.c
index 23d4976..6c2324d 100644
--- a/CLion/ExerciseBook/06.55/BiTree.c
+++ b/CLion/ExerciseBook/06.55/BiTree.c
@@ -149,7 +149,7 @@ static void CreateTree(BiTree* T, FILE* fp) {
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构，仅限内部测试使用
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/CLion/ExerciseBook/06.55/BiTree.h b/CLion/ExerciseBook/06.55/BiTree.h
index 30f9027..6d5607e 100644
--- a/CLion/ExerciseBook/06.55/BiTree.h
+++ b/CLion/ExerciseBook/06.55/BiTree.h
@@ -87,6 +87,6 @@ static void CreateTree(BiTree* T, FILE* fp);
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构，仅限内部测试使用
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/CLion/ExerciseBook/06.59-06.62/06.59-06.62.c b/CLion/ExerciseBook/06.59-06.62/06.59-06.62.c
index a9c8f37..9a6fc99 100644
--- a/CLion/ExerciseBook/06.59-06.62/06.59-06.62.c
+++ b/CLion/ExerciseBook/06.59-06.62/06.59-06.62.c
@@ -1,5 +1,4 @@
 #include <stdio.h>
-#include "Status.h"     //**▲01 绪论**//
 #include "CSTree.h"     //**▲06 树和二叉树**//
 
 #define MAX_TREE_SIZE  1024  // 树中元素数量最大值
@@ -31,7 +30,7 @@ int main(int argc, char* argv[]) {
     printf("创建树（先序序列）T...\n");
     InitTree(&T);
     CreateTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("███题 6.59 验证...███\n");
diff --git a/CLion/ExerciseBook/06.59-06.62/CSTree.c b/CLion/ExerciseBook/06.59-06.62/CSTree.c
index 318a093..41ee9fb 100644
--- a/CLion/ExerciseBook/06.59-06.62/CSTree.c
+++ b/CLion/ExerciseBook/06.59-06.62/CSTree.c
@@ -128,7 +128,7 @@ static void Depth(CSTree T, int d, int* max) {
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构
-void PrintGraph(CSTree T) {
+void PrintTree(CSTree T) {
     
     // 遇到空树则无需继续计算
     if(TreeEmpty(T)) {
diff --git a/CLion/ExerciseBook/06.59-06.62/CSTree.h b/CLion/ExerciseBook/06.59-06.62/CSTree.h
index 45a60c2..2721748 100644
--- a/CLion/ExerciseBook/06.59-06.62/CSTree.h
+++ b/CLion/ExerciseBook/06.59-06.62/CSTree.h
@@ -79,7 +79,7 @@ static void Depth(CSTree T, int d, int *max);
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构
-void PrintGraph(CSTree T);
+void PrintTree(CSTree T);
 
 // 图形化输出当前结构内部实现
 static void Print(CSTree T, int row);
diff --git a/CLion/ExerciseBook/06.63/06.63.c b/CLion/ExerciseBook/06.63/06.63.c
index c0a96d2..0c27b8d 100644
--- a/CLion/ExerciseBook/06.63/06.63.c
+++ b/CLion/ExerciseBook/06.63/06.63.c
@@ -1,5 +1,4 @@
 #include <stdio.h>
-#include "Status.h"     //**▲01 绪论**//
 #include "CTree.h"      //**▲06 树和二叉树**//
 
 /*
@@ -14,7 +13,7 @@ int main(int argc, char* argv[]) {
     printf("创建树T...\n");
     InitTree(&T);
     CreateTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("此树的深度为： %d\n", Algo_6_63(T));
diff --git a/CLion/ExerciseBook/06.63/CTree.c b/CLion/ExerciseBook/06.63/CTree.c
index 34f17d1..86a1c56 100644
--- a/CLion/ExerciseBook/06.63/CTree.c
+++ b/CLion/ExerciseBook/06.63/CTree.c
@@ -313,7 +313,7 @@ static void getPos(CTree T, Pos pt[]) {
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构
-void PrintGraph(CTree T) {
+void PrintTree(CTree T) {
     Pos pt[MAX_TREE_SIZE];
     
     // 遇到空树则无需继续计算
diff --git a/CLion/ExerciseBook/06.63/CTree.h b/CLion/ExerciseBook/06.63/CTree.h
index b75d508..622a1f0 100644
--- a/CLion/ExerciseBook/06.63/CTree.h
+++ b/CLion/ExerciseBook/06.63/CTree.h
@@ -118,7 +118,7 @@ static void getPos(CTree T, Pos pt[]);
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构
-void PrintGraph(CTree T);
+void PrintTree(CTree T);
 
 // 图形化输出当前结构内部实现
 static void Print(CTree T, Pos pt[], int i);
diff --git a/CLion/ExerciseBook/06.64/06.64.c b/CLion/ExerciseBook/06.64/06.64.c
index 425284d..94dd1a1 100644
--- a/CLion/ExerciseBook/06.64/06.64.c
+++ b/CLion/ExerciseBook/06.64/06.64.c
@@ -1,5 +1,4 @@
 #include <stdio.h>
-#include "Status.h"     //**▲01 绪论**//
 #include "PTree.h"      //**▲06 树和二叉树**//
 
 /*
@@ -14,7 +13,7 @@ int main(int argc, char* argv[]) {
     printf("创建树T...\n");
     InitTree(&T);
     CreateTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("此树的深度为： %d\n", Algo_6_64(T));
diff --git a/CLion/ExerciseBook/06.64/PTree.c b/CLion/ExerciseBook/06.64/PTree.c
index 27cd05c..644cb5d 100644
--- a/CLion/ExerciseBook/06.64/PTree.c
+++ b/CLion/ExerciseBook/06.64/PTree.c
@@ -274,7 +274,7 @@ static void getPos(PTree T, Pos pt[]) {
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构
-void PrintGraph(PTree T) {
+void PrintTree(PTree T) {
     Pos pt[MAX_TREE_SIZE];
     
     // 遇到空树则无需继续计算
diff --git a/CLion/ExerciseBook/06.64/PTree.h b/CLion/ExerciseBook/06.64/PTree.h
index 9b8cb2e..8b0bd77 100644
--- a/CLion/ExerciseBook/06.64/PTree.h
+++ b/CLion/ExerciseBook/06.64/PTree.h
@@ -106,7 +106,7 @@ static void getPos(PTree T, Pos pt[]);
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构
-void PrintGraph(PTree T);
+void PrintTree(PTree T);
 
 // 图形化输出当前结构内部实现
 static void Print(PTree T, Pos pt[], int i);
diff --git a/CLion/ExerciseBook/06.65/06.65.c b/CLion/ExerciseBook/06.65/06.65.c
index 02ce904..58a59b2 100644
--- a/CLion/ExerciseBook/06.65/06.65.c
+++ b/CLion/ExerciseBook/06.65/06.65.c
@@ -6,7 +6,7 @@
 
 /* 全局变量 */
 char Pre[] = "ABDGEHICFJ";  // 前序序列
-char In[] = "GDBHEIAFJC";  // 中序序列
+char In[]  = "GDBHEIAFJC";  // 中序序列
 
 /*
  * 由前序序列和中序序列构造二叉树
@@ -26,7 +26,7 @@ int main(int argc, char* argv[]) {
     
     printf("由此构造的二叉树为 T = \n");
     Algo_6_65(&T);
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     return 0;
diff --git a/CLion/ExerciseBook/06.65/BiTree.c b/CLion/ExerciseBook/06.65/BiTree.c
index 6dc871b..0f68544 100644
--- a/CLion/ExerciseBook/06.65/BiTree.c
+++ b/CLion/ExerciseBook/06.65/BiTree.c
@@ -50,7 +50,7 @@ int BiTreeDepth(BiTree T) {
 }
 
 // 以图形化形式输出当前结构，仅限内部测试使用
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/CLion/ExerciseBook/06.65/BiTree.h b/CLion/ExerciseBook/06.65/BiTree.h
index ee19645..ac75fb8 100644
--- a/CLion/ExerciseBook/06.65/BiTree.h
+++ b/CLion/ExerciseBook/06.65/BiTree.h
@@ -49,6 +49,6 @@ Status BiTreeEmpty(BiTree T);
 int BiTreeDepth(BiTree T);
 
 // 以图形化形式输出当前结构，仅限内部测试使用
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/CLion/ExerciseBook/06.66/06.66.c b/CLion/ExerciseBook/06.66/06.66.c
index 9e27a96..9566b64 100644
--- a/CLion/ExerciseBook/06.66/06.66.c
+++ b/CLion/ExerciseBook/06.66/06.66.c
@@ -17,12 +17,12 @@ int main(int argc, char* argv[]) {
     printf("创建树T...\n");
     InitTree_P(&PT);
     CreateTree_P(&PT, "TestData.txt");
-    PrintGraph_P(PT);
+    PrintTree_P(PT);
     printf("\n");
     
     printf("树的双亲表示法转为树的孩子-兄弟表示法：\n");
     CST = Algo_6_66(PT);
-    PrintGraph_CS(CST);
+    PrintTree_CS(CST);
     printf("\n");
     
     return 0;
diff --git a/CLion/ExerciseBook/06.66/CSTree.c b/CLion/ExerciseBook/06.66/CSTree.c
index 8d2245e..d401104 100644
--- a/CLion/ExerciseBook/06.66/CSTree.c
+++ b/CLion/ExerciseBook/06.66/CSTree.c
@@ -29,7 +29,7 @@ Status TreeEmpty_CS(CSTree T) {
 }
 
 // 以图形化形式输出当前结构
-void PrintGraph_CS(CSTree T) {
+void PrintTree_CS(CSTree T) {
     
     // 遇到空树则无需继续计算
     if(TreeEmpty_CS(T)) {
diff --git a/CLion/ExerciseBook/06.66/CSTree.h b/CLion/ExerciseBook/06.66/CSTree.h
index e2ff2c0..7bb5dac 100644
--- a/CLion/ExerciseBook/06.66/CSTree.h
+++ b/CLion/ExerciseBook/06.66/CSTree.h
@@ -42,7 +42,7 @@ Status InitTree_CS(CSTree* T);
 Status TreeEmpty_CS(CSTree T);
 
 // 以图形化形式输出当前结构
-void PrintGraph_CS(CSTree T);
+void PrintTree_CS(CSTree T);
 
 // 图形化输出当前结构内部实现
 static void Print_CS(CSTree T, int row);
diff --git a/CLion/ExerciseBook/06.66/PTree.c b/CLion/ExerciseBook/06.66/PTree.c
index 4693531..f032728 100644
--- a/CLion/ExerciseBook/06.66/PTree.c
+++ b/CLion/ExerciseBook/06.66/PTree.c
@@ -246,7 +246,7 @@ static void getPos_P(PTree T, Pos pt[]) {
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构
-void PrintGraph_P(PTree T) {
+void PrintTree_P(PTree T) {
     Pos pt[MAX_TREE_SIZE];
     
     // 遇到空树则无需继续计算
diff --git a/CLion/ExerciseBook/06.66/PTree.h b/CLion/ExerciseBook/06.66/PTree.h
index d4528fd..f45da9c 100644
--- a/CLion/ExerciseBook/06.66/PTree.h
+++ b/CLion/ExerciseBook/06.66/PTree.h
@@ -99,7 +99,7 @@ static void getPos_P(PTree T, Pos pt[]);
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构
-void PrintGraph_P(PTree T);
+void PrintTree_P(PTree T);
 
 // 图形化输出当前结构内部实现
 static void Print_P(PTree T, Pos pt[], int i);
diff --git a/CLion/ExerciseBook/06.67/06.67.c b/CLion/ExerciseBook/06.67/06.67.c
index bdf0ebc..87ddee4 100644
--- a/CLion/ExerciseBook/06.67/06.67.c
+++ b/CLion/ExerciseBook/06.67/06.67.c
@@ -21,7 +21,7 @@ int main(int argc, char* argv[]) {
     fclose(fp);
     printf("\n");
     
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     return 0;
diff --git a/CLion/ExerciseBook/06.67/CSTree.c b/CLion/ExerciseBook/06.67/CSTree.c
index 37a4c27..3491acf 100644
--- a/CLion/ExerciseBook/06.67/CSTree.c
+++ b/CLion/ExerciseBook/06.67/CSTree.c
@@ -29,7 +29,7 @@ Status TreeEmpty(CSTree T) {
 }
 
 // 以图形化形式输出当前结构
-void PrintGraph(CSTree T) {
+void PrintTree(CSTree T) {
     
     // 遇到空树则无需继续计算
     if(TreeEmpty(T)) {
diff --git a/CLion/ExerciseBook/06.67/CSTree.h b/CLion/ExerciseBook/06.67/CSTree.h
index ac663b1..f2c6ddf 100644
--- a/CLion/ExerciseBook/06.67/CSTree.h
+++ b/CLion/ExerciseBook/06.67/CSTree.h
@@ -42,7 +42,7 @@ Status InitTree(CSTree* T);
 Status TreeEmpty(CSTree T);
 
 // 以图形化形式输出当前结构
-void PrintGraph(CSTree T);
+void PrintTree(CSTree T);
 
 // 图形化输出当前结构内部实现
 static void Print(CSTree T, int row);
diff --git a/CLion/ExerciseBook/06.68/06.68.c b/CLion/ExerciseBook/06.68/06.68.c
index fc23651..8c451fa 100644
--- a/CLion/ExerciseBook/06.68/06.68.c
+++ b/CLion/ExerciseBook/06.68/06.68.c
@@ -21,7 +21,7 @@ int main(int argc, char* argv[]) {
     fclose(fp);
     printf("\n");
     
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     return 0;
diff --git a/CLion/ExerciseBook/06.68/CSTree.c b/CLion/ExerciseBook/06.68/CSTree.c
index 37a4c27..3491acf 100644
--- a/CLion/ExerciseBook/06.68/CSTree.c
+++ b/CLion/ExerciseBook/06.68/CSTree.c
@@ -29,7 +29,7 @@ Status TreeEmpty(CSTree T) {
 }
 
 // 以图形化形式输出当前结构
-void PrintGraph(CSTree T) {
+void PrintTree(CSTree T) {
     
     // 遇到空树则无需继续计算
     if(TreeEmpty(T)) {
diff --git a/CLion/ExerciseBook/06.68/CSTree.h b/CLion/ExerciseBook/06.68/CSTree.h
index ac663b1..f2c6ddf 100644
--- a/CLion/ExerciseBook/06.68/CSTree.h
+++ b/CLion/ExerciseBook/06.68/CSTree.h
@@ -42,7 +42,7 @@ Status InitTree(CSTree* T);
 Status TreeEmpty(CSTree T);
 
 // 以图形化形式输出当前结构
-void PrintGraph(CSTree T);
+void PrintTree(CSTree T);
 
 // 图形化输出当前结构内部实现
 static void Print(CSTree T, int row);
diff --git a/CLion/ExerciseBook/06.69/06.69.c b/CLion/ExerciseBook/06.69/06.69.c
index f16b581..c21beb2 100644
--- a/CLion/ExerciseBook/06.69/06.69.c
+++ b/CLion/ExerciseBook/06.69/06.69.c
@@ -14,7 +14,7 @@ int main(int argc, char* argv[]) {
     printf("创建二叉树（先序序列）T...\n");
     InitBiTree(&T);
     CreateBiTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("逆中序序列且按层序打印树：\n");
diff --git a/CLion/ExerciseBook/06.69/BiTree.c b/CLion/ExerciseBook/06.69/BiTree.c
index 23d4976..6c2324d 100644
--- a/CLion/ExerciseBook/06.69/BiTree.c
+++ b/CLion/ExerciseBook/06.69/BiTree.c
@@ -149,7 +149,7 @@ static void CreateTree(BiTree* T, FILE* fp) {
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构，仅限内部测试使用
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/CLion/ExerciseBook/06.69/BiTree.h b/CLion/ExerciseBook/06.69/BiTree.h
index 30f9027..6d5607e 100644
--- a/CLion/ExerciseBook/06.69/BiTree.h
+++ b/CLion/ExerciseBook/06.69/BiTree.h
@@ -87,6 +87,6 @@ static void CreateTree(BiTree* T, FILE* fp);
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构，仅限内部测试使用
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/CLion/ExerciseBook/06.70/06.70.c b/CLion/ExerciseBook/06.70/06.70.c
index 5467751..a00379c 100644
--- a/CLion/ExerciseBook/06.70/06.70.c
+++ b/CLion/ExerciseBook/06.70/06.70.c
@@ -17,7 +17,7 @@ int main(int argc, char* argv[]) {
     fp = fopen("TestData.txt", "r");
     Algo_6_70(&T, fp);
     fclose(fp);
-    PrintGraph(T);
+    PrintTree(T);
     
     return 0;
 }
diff --git a/CLion/ExerciseBook/06.70/BiTree.c b/CLion/ExerciseBook/06.70/BiTree.c
index 6dc871b..0f68544 100644
--- a/CLion/ExerciseBook/06.70/BiTree.c
+++ b/CLion/ExerciseBook/06.70/BiTree.c
@@ -50,7 +50,7 @@ int BiTreeDepth(BiTree T) {
 }
 
 // 以图形化形式输出当前结构，仅限内部测试使用
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/CLion/ExerciseBook/06.70/BiTree.h b/CLion/ExerciseBook/06.70/BiTree.h
index ee19645..ac75fb8 100644
--- a/CLion/ExerciseBook/06.70/BiTree.h
+++ b/CLion/ExerciseBook/06.70/BiTree.h
@@ -49,6 +49,6 @@ Status BiTreeEmpty(BiTree T);
 int BiTreeDepth(BiTree T);
 
 // 以图形化形式输出当前结构，仅限内部测试使用
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/CLion/ExerciseBook/06.71/06.71.c b/CLion/ExerciseBook/06.71/06.71.c
index 7514773..49f4f1b 100644
--- a/CLion/ExerciseBook/06.71/06.71.c
+++ b/CLion/ExerciseBook/06.71/06.71.c
@@ -21,7 +21,7 @@ int main(int argc, char* argv[]) {
     printf("创建树（先序序列）T...\n");
     InitTree(&T);
     CreateTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("方法 1：先序遍历按凹入表打印树：\n");
diff --git a/CLion/ExerciseBook/06.71/CSTree.c b/CLion/ExerciseBook/06.71/CSTree.c
index 318a093..41ee9fb 100644
--- a/CLion/ExerciseBook/06.71/CSTree.c
+++ b/CLion/ExerciseBook/06.71/CSTree.c
@@ -128,7 +128,7 @@ static void Depth(CSTree T, int d, int* max) {
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构
-void PrintGraph(CSTree T) {
+void PrintTree(CSTree T) {
     
     // 遇到空树则无需继续计算
     if(TreeEmpty(T)) {
diff --git a/CLion/ExerciseBook/06.71/CSTree.h b/CLion/ExerciseBook/06.71/CSTree.h
index 45a60c2..2721748 100644
--- a/CLion/ExerciseBook/06.71/CSTree.h
+++ b/CLion/ExerciseBook/06.71/CSTree.h
@@ -79,7 +79,7 @@ static void Depth(CSTree T, int d, int *max);
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构
-void PrintGraph(CSTree T);
+void PrintTree(CSTree T);
 
 // 图形化输出当前结构内部实现
 static void Print(CSTree T, int row);
diff --git a/CLion/ExerciseBook/06.72/06.72.c b/CLion/ExerciseBook/06.72/06.72.c
index a281393..93c9ef2 100644
--- a/CLion/ExerciseBook/06.72/06.72.c
+++ b/CLion/ExerciseBook/06.72/06.72.c
@@ -1,5 +1,4 @@
 #include <stdio.h>
-#include "Status.h"     //**▲01 绪论**//
 #include "CTree.h"      //**▲06 树和二叉树**//
 
 /*
@@ -21,7 +20,7 @@ int main(int argc, char* argv[]) {
     printf("创建树T...\n");
     InitTree(&T);
     CreateTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("先序遍历按凹入表打印树：\n");
diff --git a/CLion/ExerciseBook/06.72/CTree.c b/CLion/ExerciseBook/06.72/CTree.c
index 34f17d1..86a1c56 100644
--- a/CLion/ExerciseBook/06.72/CTree.c
+++ b/CLion/ExerciseBook/06.72/CTree.c
@@ -313,7 +313,7 @@ static void getPos(CTree T, Pos pt[]) {
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构
-void PrintGraph(CTree T) {
+void PrintTree(CTree T) {
     Pos pt[MAX_TREE_SIZE];
     
     // 遇到空树则无需继续计算
diff --git a/CLion/ExerciseBook/06.72/CTree.h b/CLion/ExerciseBook/06.72/CTree.h
index b75d508..622a1f0 100644
--- a/CLion/ExerciseBook/06.72/CTree.h
+++ b/CLion/ExerciseBook/06.72/CTree.h
@@ -118,7 +118,7 @@ static void getPos(CTree T, Pos pt[]);
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构
-void PrintGraph(CTree T);
+void PrintTree(CTree T);
 
 // 图形化输出当前结构内部实现
 static void Print(CTree T, Pos pt[], int i);
diff --git a/CLion/ExerciseBook/06.73-06.74/06.73-06.74.c b/CLion/ExerciseBook/06.73-06.74/06.73-06.74.c
index 23a3403..79f1941 100644
--- a/CLion/ExerciseBook/06.73-06.74/06.73-06.74.c
+++ b/CLion/ExerciseBook/06.73-06.74/06.73-06.74.c
@@ -23,7 +23,7 @@ int main(int argc, char* argv[]) {
     fp = fopen("TestData.txt", "r");
     Algo_6_73(&T, fp);
     fclose(fp);
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("███ 题 6.74 验证... ███\n");
diff --git a/CLion/ExerciseBook/06.73-06.74/CSTree.c b/CLion/ExerciseBook/06.73-06.74/CSTree.c
index 37a4c27..3491acf 100644
--- a/CLion/ExerciseBook/06.73-06.74/CSTree.c
+++ b/CLion/ExerciseBook/06.73-06.74/CSTree.c
@@ -29,7 +29,7 @@ Status TreeEmpty(CSTree T) {
 }
 
 // 以图形化形式输出当前结构
-void PrintGraph(CSTree T) {
+void PrintTree(CSTree T) {
     
     // 遇到空树则无需继续计算
     if(TreeEmpty(T)) {
diff --git a/CLion/ExerciseBook/06.73-06.74/CSTree.h b/CLion/ExerciseBook/06.73-06.74/CSTree.h
index ac663b1..f2c6ddf 100644
--- a/CLion/ExerciseBook/06.73-06.74/CSTree.h
+++ b/CLion/ExerciseBook/06.73-06.74/CSTree.h
@@ -42,7 +42,7 @@ Status InitTree(CSTree* T);
 Status TreeEmpty(CSTree T);
 
 // 以图形化形式输出当前结构
-void PrintGraph(CSTree T);
+void PrintTree(CSTree T);
 
 // 图形化输出当前结构内部实现
 static void Print(CSTree T, int row);
diff --git a/CLion/ExerciseBook/06.75-06.76/06.75-06.76.c b/CLion/ExerciseBook/06.75-06.76/06.75-06.76.c
index 79b8d11..dd15455 100644
--- a/CLion/ExerciseBook/06.75-06.76/06.75-06.76.c
+++ b/CLion/ExerciseBook/06.75-06.76/06.75-06.76.c
@@ -26,7 +26,7 @@ int main(int argc, char* argv[]) {
     fp = fopen("TestData.txt", "r");
     Algo_6_75(&T, fp);
     fclose(fp);
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("题 6.76 验证...\n");
diff --git a/CLion/ExerciseBook/06.75-06.76/CTree.c b/CLion/ExerciseBook/06.75-06.76/CTree.c
index b97fa74..7303304 100644
--- a/CLion/ExerciseBook/06.75-06.76/CTree.c
+++ b/CLion/ExerciseBook/06.75-06.76/CTree.c
@@ -131,7 +131,7 @@ static void getPos(CTree T, Pos pt[]) {
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构
-void PrintGraph(CTree T) {
+void PrintTree(CTree T) {
     Pos pt[MAX_TREE_SIZE];
     
     // 遇到空树则无需继续计算
diff --git a/CLion/ExerciseBook/06.75-06.76/CTree.h b/CLion/ExerciseBook/06.75-06.76/CTree.h
index b72ab56..62f1eb7 100644
--- a/CLion/ExerciseBook/06.75-06.76/CTree.h
+++ b/CLion/ExerciseBook/06.75-06.76/CTree.h
@@ -97,7 +97,7 @@ static void getPos(CTree T, Pos pt[]);
 /*━━━━━━━━━━━━━━━━━━━━━━ 图形化输出 ━━━━━━━━━━━━━━━━━━━━━━*/
 
 // 以图形化形式输出当前结构
-void PrintGraph(CTree T);
+void PrintTree(CTree T);
 
 // 图形化输出当前结构内部实现
 static void Print(CTree T, Pos pt[], int i);
diff --git a/CLion/Status/Status.c b/CLion/Status/Status.c
index be9a4e6..677db90 100644
--- a/CLion/Status/Status.c
+++ b/CLion/Status/Status.c
@@ -162,3 +162,19 @@ void Wait(long time) {
         // 空循环
     }
 }
+
+// 跳过输入端的行分割符，如'\r'、'\n'、'\r\n'
+void skipLineSeparator(FILE* fp) {
+    int ch;
+    
+    if(fp == NULL) {
+        return;
+    }
+    
+    while((ch = getc(fp)) != EOF) {
+        if(ch >= 0 && ch <= 127 && ch != '\r' && ch != '\n') {
+            ungetc(ch, fp);
+            break;
+        }
+    }
+}
diff --git a/CLion/Status/Status.h b/CLion/Status/Status.h
index 0279a70..acb6b21 100644
--- a/CLion/Status/Status.h
+++ b/CLion/Status/Status.h
@@ -30,6 +30,9 @@
 /* 状态码类型 */
 typedef int Status;
 
+/* 布尔类型 */
+typedef int Boolean;
+
 
 // 读取数据
 int ReadData(FILE* fp, char* format, ...);
@@ -40,6 +43,9 @@ void PressEnterToContinue();
 // 函数暂停一段时间，time不代表具体的时间
 void Wait(long time);
 
+// 跳过输入端的行分割符，如'\r'、'\n'、'\r\n'
+void skipLineSeparator(FILE* fp);
+
 #endif
 
 
diff --git a/Dev-C++/CourseBook/0206_SLinkList/SLinkList.cpp b/Dev-C++/CourseBook/0206_SLinkList/SLinkList.cpp
index 8884b59..4e7d466 100644
--- a/Dev-C++/CourseBook/0206_SLinkList/SLinkList.cpp
+++ b/Dev-C++/CourseBook/0206_SLinkList/SLinkList.cpp
@@ -451,7 +451,7 @@ void ListTraverse(SLinkList space, int S, void(Visit)(ElemType)) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(SLinkList space, int S) {
+void PrintList(SLinkList space, int S) {
     int i = 0;
     
     printf("==== ���ÿռ� ====\n");
diff --git a/Dev-C++/CourseBook/0206_SLinkList/SLinkList.h b/Dev-C++/CourseBook/0206_SLinkList/SLinkList.h
index c511f6c..e5048b5 100644
--- a/Dev-C++/CourseBook/0206_SLinkList/SLinkList.h
+++ b/Dev-C++/CourseBook/0206_SLinkList/SLinkList.h
@@ -203,6 +203,6 @@ void ListTraverse(SLinkList space, int S, void(Visit)(ElemType));
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(SLinkList space, int S);
+void PrintList(SLinkList space, int S);
 
 #endif
diff --git a/Dev-C++/CourseBook/0207_Difference/SLinkList.cpp b/Dev-C++/CourseBook/0207_Difference/SLinkList.cpp
index 624e0ea..ee2980f 100644
--- a/Dev-C++/CourseBook/0207_Difference/SLinkList.cpp
+++ b/Dev-C++/CourseBook/0207_Difference/SLinkList.cpp
@@ -98,7 +98,7 @@ void ListTraverse(SLinkList space, int S, void(Visit)(ElemType)) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(SLinkList space, int S) {
+void PrintList(SLinkList space, int S) {
     int i = 0;
     
     printf("==== ���ÿռ� ====\n");
diff --git a/Dev-C++/CourseBook/0207_Difference/SLinkList.h b/Dev-C++/CourseBook/0207_Difference/SLinkList.h
index d92bdf6..ea30c65 100644
--- a/Dev-C++/CourseBook/0207_Difference/SLinkList.h
+++ b/Dev-C++/CourseBook/0207_Difference/SLinkList.h
@@ -84,6 +84,6 @@ void ListTraverse(SLinkList space, int S, void(Visit)(ElemType));
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(SLinkList space, int S);
+void PrintList(SLinkList space, int S);
 
 #endif
diff --git a/Dev-C++/CourseBook/0207_Difference/TestData.txt b/Dev-C++/CourseBook/0207_Difference/TestData.txt
index 93de27f..5bec6a5 100644
--- a/Dev-C++/CourseBook/0207_Difference/TestData.txt
+++ b/Dev-C++/CourseBook/0207_Difference/TestData.txt
@@ -1,4 +1,4 @@
 ����A�ij��ȣ�3
 ����B�ij��ȣ�5
 ����A��Ԫ�أ�2 3 4
-����B��Ԫ�أ�1 3 4 6 7
\ No newline at end of file
+����B��Ԫ�أ�1 3 4 6 7
diff --git a/Dev-C++/CourseBook/0210_MergeEList/MergeEList.cpp b/Dev-C++/CourseBook/0210_MergeEList/MergeEList.cpp
index e445d32..2d0dea0 100644
--- a/Dev-C++/CourseBook/0210_MergeEList/MergeEList.cpp
+++ b/Dev-C++/CourseBook/0210_MergeEList/MergeEList.cpp
@@ -72,4 +72,5 @@ Status MergeEList(ELinkList* La, ELinkList* Lb, ELinkList* Lc, int(Compare)(Elem
     Lb->len = 0;
     
     return OK;
-}
\ No newline at end of file
+}
+
diff --git a/Dev-C++/CourseBook/0210_MergeEList/MergeEList.h b/Dev-C++/CourseBook/0210_MergeEList/MergeEList.h
index 5137f17..ad404a8 100644
--- a/Dev-C++/CourseBook/0210_MergeEList/MergeEList.h
+++ b/Dev-C++/CourseBook/0210_MergeEList/MergeEList.h
@@ -27,10 +27,5 @@
  */
 Status MergeEList(ELinkList* La, ELinkList* Lb, ELinkList* Lc, int(Compare)(ElemType, ElemType));
 
-/*������������������������������������������������������������������������
-��(01)�㷨2.21��La��Lb���ǵݼ����У�����鲢Ϊһ���ǵݼ����еĵ�����Lc����
-������������������������������������������������������������������������*/
-
-
-
 #endif
+
diff --git a/Dev-C++/CourseBook/0505_GList-HT/GList-HT-main.cpp b/Dev-C++/CourseBook/0505_GList-HT/GList-HT-main.cpp
index 37097f3..b54376d 100644
--- a/Dev-C++/CourseBook/0505_GList-HT/GList-HT-main.cpp
+++ b/Dev-C++/CourseBook/0505_GList-HT/GList-HT-main.cpp
@@ -61,10 +61,10 @@ int main(int argc, char** argv) {
     }
     PressEnterToContinue();
 
-    printf("���������������� ���� PrintGraph \n");
+    printf("���������������� ���� PrintGList \n");
     {
         printf("�� �������������� Tmp = ");
-        PrintGraph(Tmp);
+        PrintGList(Tmp);
     }
     PressEnterToContinue();
 
@@ -72,7 +72,7 @@ int main(int argc, char** argv) {
     {
         printf("�� ���� Tmp �� G = ");
         CopyGList(&G, Tmp);
-        PrintGraph(G);
+        PrintGList(G);
     }
     PressEnterToContinue();
 
@@ -83,10 +83,10 @@ int main(int argc, char** argv) {
         printf("�� ɾ������� Tmp �ı�ͷ��");
 
         DeleteFirst(&Tmp, &h);
-        PrintGraph(h);
+        PrintGList(h);
 
         printf("�� Tmp = ");
-        PrintGraph(Tmp);
+        PrintGList(Tmp);
     }
     PressEnterToContinue();
 
@@ -108,7 +108,7 @@ int main(int argc, char** argv) {
 
         printf("�� ����� G �ı�ͷ H = ");
         H = GetHead(G);
-        PrintGraph(H);
+        PrintGList(H);
     }
     PressEnterToContinue();
 
@@ -118,7 +118,7 @@ int main(int argc, char** argv) {
 
         printf("�� ����� G �ı�β T = ");
         T = GetTail(G);
-        PrintGraph(T);
+        PrintGList(T);
     }
     PressEnterToContinue();
 
diff --git a/Dev-C++/CourseBook/0505_GList-HT/GList-HT.cpp b/Dev-C++/CourseBook/0505_GList-HT/GList-HT.cpp
index bad30df..a761587 100644
--- a/Dev-C++/CourseBook/0505_GList-HT/GList-HT.cpp
+++ b/Dev-C++/CourseBook/0505_GList-HT/GList-HT.cpp
@@ -335,7 +335,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * ��������������L��
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L, Head);
     printf("\n");
 }
diff --git a/Dev-C++/CourseBook/0505_GList-HT/GList-HT.h b/Dev-C++/CourseBook/0505_GList-HT/GList-HT.h
index 508b96f..bc90362 100644
--- a/Dev-C++/CourseBook/0505_GList-HT/GList-HT.h
+++ b/Dev-C++/CourseBook/0505_GList-HT/GList-HT.h
@@ -143,7 +143,7 @@ void Traverse(GList L, void (Visit)(AtomType));
  *
  * ��������������L��
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * ͼ�λ�������ڲ�ʵ�֣�mark��ͼ�λ������ǡ�
diff --git a/Dev-C++/CourseBook/0506_GList-E/GList-E-main.cpp b/Dev-C++/CourseBook/0506_GList-E/GList-E-main.cpp
index c928a01..b33b5e8 100644
--- a/Dev-C++/CourseBook/0506_GList-E/GList-E-main.cpp
+++ b/Dev-C++/CourseBook/0506_GList-E/GList-E-main.cpp
@@ -61,10 +61,10 @@ int main(int argc, char** argv) {
     }
     PressEnterToContinue();
     
-    printf("���������������� ���� PrintGraph \n");
+    printf("���������������� ���� PrintGList \n");
     {
         printf("�� �������������� Tmp = ");
-        PrintGraph(Tmp);
+        PrintGList(Tmp);
     }
     PressEnterToContinue();
     
@@ -72,7 +72,7 @@ int main(int argc, char** argv) {
     {
         printf("�� ���� Tmp �� G = ");
         CopyGList(&G, Tmp);
-        PrintGraph(G);
+        PrintGList(G);
     }
     PressEnterToContinue();
     
@@ -83,10 +83,10 @@ int main(int argc, char** argv) {
         printf("�� ɾ������� Tmp �ı�ͷ��");
         DeleteFirst(&Tmp, &h);
         
-        PrintGraph(h);
+        PrintGList(h);
         
         printf("�� Tmp = ");
-        PrintGraph(Tmp);
+        PrintGList(Tmp);
     }
     PressEnterToContinue();
     
@@ -108,7 +108,7 @@ int main(int argc, char** argv) {
         
         printf("�� ��ȡ����� G �ı�ͷ H = ");
         H = GetHead(G);
-        PrintGraph(H);
+        PrintGList(H);
     }
     PressEnterToContinue();
     
@@ -118,7 +118,7 @@ int main(int argc, char** argv) {
         
         printf("�� ��ȡ����� G �ı�β T = ");
         T = GetTail(G);
-        PrintGraph(T);
+        PrintGList(T);
     }
     PressEnterToContinue();
     
diff --git a/Dev-C++/CourseBook/0506_GList-E/GList-E.cpp b/Dev-C++/CourseBook/0506_GList-E/GList-E.cpp
index 3fc0ad9..e5b2ccb 100644
--- a/Dev-C++/CourseBook/0506_GList-E/GList-E.cpp
+++ b/Dev-C++/CourseBook/0506_GList-E/GList-E.cpp
@@ -370,7 +370,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * ��������������L��
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L);
     printf("\n");
 }
diff --git a/Dev-C++/CourseBook/0506_GList-E/GList-E.h b/Dev-C++/CourseBook/0506_GList-E/GList-E.h
index fa9af82..b2b002c 100644
--- a/Dev-C++/CourseBook/0506_GList-E/GList-E.h
+++ b/Dev-C++/CourseBook/0506_GList-E/GList-E.h
@@ -126,7 +126,7 @@ void Traverse(GList L, void(Visit)(AtomType));
  *
  * ��������������L��
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * ͼ�λ�������ڲ�ʵ�֡�
diff --git a/Dev-C++/CourseBook/0507_MPList/MPList-main.cpp b/Dev-C++/CourseBook/0507_MPList/MPList-main.cpp
index 1d1ebbe..acb4f8c 100644
--- a/Dev-C++/CourseBook/0507_MPList/MPList-main.cpp
+++ b/Dev-C++/CourseBook/0507_MPList/MPList-main.cpp
@@ -7,6 +7,6 @@ int main(int argc, char** argv) {
 
     printf("������Ԫ����ʽ...\n");
     CreateMPList(&P, s, "zxy");
-    PrintGraph(P);
+    PrintMPList(P);
 }
 
diff --git a/Dev-C++/CourseBook/0507_MPList/MPList.cpp b/Dev-C++/CourseBook/0507_MPList/MPList.cpp
index 782e97b..dc85079 100644
--- a/Dev-C++/CourseBook/0507_MPList/MPList.cpp
+++ b/Dev-C++/CourseBook/0507_MPList/MPList.cpp
@@ -111,7 +111,7 @@ static Status Create(MPList* P, char* S) {
  *
  * ���������mԪ����P��
  */
-void PrintGraph(MPList P) {
+void PrintMPList(MPList P) {
     if(P == NULL) {
         printf("\n");
         return;
diff --git a/Dev-C++/CourseBook/0507_MPList/MPList.h b/Dev-C++/CourseBook/0507_MPList/MPList.h
index a526fed..95a0fed 100644
--- a/Dev-C++/CourseBook/0507_MPList/MPList.h
+++ b/Dev-C++/CourseBook/0507_MPList/MPList.h
@@ -72,7 +72,7 @@ static Status Create(MPList* P, char* S);
  *
  * ���������mԪ����P��
  */
-void PrintGraph(MPList P);
+void PrintMPList(MPList P);
 
 /*
  * ͼ�λ�������ڲ�ʵ��
diff --git a/Dev-C++/CourseBook/0601_SqBiTree/SqBiTree-main.cpp b/Dev-C++/CourseBook/0601_SqBiTree/SqBiTree-main.cpp
index 4505253..2227b81 100644
--- a/Dev-C++/CourseBook/0601_SqBiTree/SqBiTree-main.cpp
+++ b/Dev-C++/CourseBook/0601_SqBiTree/SqBiTree-main.cpp
@@ -35,10 +35,10 @@ int main(int argc, char* argv[]) {
     PressEnterToContinue();
     
     
-    printf("���������������� PrintGraph \n");
+    printf("���������������� PrintTree \n");
     {
         printf("�� ���������Ľṹ��ӡ�� T ...\n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -89,7 +89,7 @@ int main(int argc, char* argv[]) {
         TElemType value = 'X';
         printf("�� ����� %c ��ֵΪ %c ��T = \n", e, value);
         Assign(T, e, value);
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -142,20 +142,20 @@ int main(int argc, char* argv[]) {
         printf("�� �������� c1 ...\n");
         InitBiTree(c1);
         CreateBiTree(c1, "TestData_c1.txt");
-        PrintGraph(c1);
+        PrintTree(c1);
     
         printf("�� �������� c2 ...\n");
         InitBiTree(c2);
         CreateBiTree(c2, "TestData_c2.txt");
-        PrintGraph(c2);
+        PrintTree(c2);
     
         printf("�� ������ c1 ���������� T �� %c ���������� ...\n", p1);
         InsertChild(T, p1, 1, c1);
-        PrintGraph(T);
+        PrintTree(T);
     
         printf("�� ������ c2 ���������� T �� %c ���������� ...\n", p2);
         InsertChild(T, p2, 0, c2);
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -167,11 +167,11 @@ int main(int argc, char* argv[]) {
     
         printf("�� ɾ�������� T �� %c ���������� ...\n", p1);
         DeleteChild(T, p1, 1);
-        PrintGraph(T);
+        PrintTree(T);
     
         printf("�� ɾ�������� T �� %c ���������� ...\n", p2);
         DeleteChild(T, p2, 0);
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
diff --git a/Dev-C++/CourseBook/0601_SqBiTree/SqBiTree.cpp b/Dev-C++/CourseBook/0601_SqBiTree/SqBiTree.cpp
index b2b8a58..0173ae9 100644
--- a/Dev-C++/CourseBook/0601_SqBiTree/SqBiTree.cpp
+++ b/Dev-C++/CourseBook/0601_SqBiTree/SqBiTree.cpp
@@ -628,7 +628,7 @@ static Status PostTraverse(SqBiTree T, Status(Visit)(TElemType), int i) {
 
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
-void PrintGraph(SqBiTree T) {
+void PrintTree(SqBiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/Dev-C++/CourseBook/0601_SqBiTree/SqBiTree.h b/Dev-C++/CourseBook/0601_SqBiTree/SqBiTree.h
index 5f0b5da..c1bfd6f 100644
--- a/Dev-C++/CourseBook/0601_SqBiTree/SqBiTree.h
+++ b/Dev-C++/CourseBook/0601_SqBiTree/SqBiTree.h
@@ -205,6 +205,6 @@ static Status PostTraverse(SqBiTree T, Status(Visit)(TElemType), int i);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(SqBiTree T);
+void PrintTree(SqBiTree T);
 
 #endif
diff --git a/Dev-C++/CourseBook/0601_SqBiTree/TestData_Pre.txt b/Dev-C++/CourseBook/0601_SqBiTree/TestData_Pre.txt
index ca28844..3f8298f 100644
--- a/Dev-C++/CourseBook/0601_SqBiTree/TestData_Pre.txt
+++ b/Dev-C++/CourseBook/0601_SqBiTree/TestData_Pre.txt
@@ -1 +1 @@
-�������У����ϵ����Ǵ����ս�㣩��ABDG^^^EH^^I^^CF^J^^^
\ No newline at end of file
+�������У����ϵ����Ǵ����ս�㣩��ABDG^^^EH^^I^^CF^J^^^
diff --git a/Dev-C++/CourseBook/0601_SqBiTree/TestData_c1.txt b/Dev-C++/CourseBook/0601_SqBiTree/TestData_c1.txt
index a8a1f32..97dcfdc 100644
--- a/Dev-C++/CourseBook/0601_SqBiTree/TestData_c1.txt
+++ b/Dev-C++/CourseBook/0601_SqBiTree/TestData_c1.txt
@@ -1 +1 @@
-�������У����ϵ����Ǵ����ս�㣩��abc^^d^^^
\ No newline at end of file
+�������У����ϵ����Ǵ����ս�㣩��abc^^d^^^
diff --git a/Dev-C++/CourseBook/0601_SqBiTree/TestData_c2.txt b/Dev-C++/CourseBook/0601_SqBiTree/TestData_c2.txt
index c631228..d73dd8c 100644
--- a/Dev-C++/CourseBook/0601_SqBiTree/TestData_c2.txt
+++ b/Dev-C++/CourseBook/0601_SqBiTree/TestData_c2.txt
@@ -1 +1 @@
-�������У����ϵ����Ǵ����ս�㣩��12^3^^^
\ No newline at end of file
+�������У����ϵ����Ǵ����ս�㣩��12^3^^^
diff --git a/Dev-C++/CourseBook/0602_BiTree/BiTree-main.cpp b/Dev-C++/CourseBook/0602_BiTree/BiTree-main.cpp
index 2224131..a4365ff 100644
--- a/Dev-C++/CourseBook/0602_BiTree/BiTree-main.cpp
+++ b/Dev-C++/CourseBook/0602_BiTree/BiTree-main.cpp
@@ -35,10 +35,10 @@ int main(int argc, char* argv[]) {
     PressEnterToContinue();
     
     
-    printf("���������������� PrintGraph \n");
+    printf("���������������� PrintTree \n");
     {
         printf("�� ���������Ľṹ��ӡ�� T ...\n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -89,7 +89,7 @@ int main(int argc, char* argv[]) {
         TElemType value = 'X';
         printf("�� ����� %c ��ֵΪ %c ��T = \n", e, value);
         Assign(T, e, value);
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -142,20 +142,20 @@ int main(int argc, char* argv[]) {
         printf("�� �������� c1 ...\n");
         InitBiTree(&c1);
         CreateBiTree(&c1, "TestData_c1.txt");
-        PrintGraph(c1);
+        PrintTree(c1);
         
         printf("�� �������� c2 ...\n");
         InitBiTree(&c2);
         CreateBiTree(&c2, "TestData_c2.txt");
-        PrintGraph(c2);
+        PrintTree(c2);
         
         printf("�� ������ c1 ���������� T �� %c ���������� ...\n", p1);
         InsertChild(T, p1, 1, c1);
-        PrintGraph(T);
+        PrintTree(T);
         
         printf("�� ������ c2 ���������� T �� %c ���������� ...\n", p2);
         InsertChild(T, p2, 0, c2);
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -167,11 +167,11 @@ int main(int argc, char* argv[]) {
         
         printf("�� ɾ�������� T �� %c ���������� ...\n", p1);
         DeleteChild(T, p1, 1);
-        PrintGraph(T);
+        PrintTree(T);
         
         printf("�� ɾ�������� T �� %c ���������� ...\n", p2);
         DeleteChild(T, p2, 0);
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
diff --git a/Dev-C++/CourseBook/0602_BiTree/BiTree.cpp b/Dev-C++/CourseBook/0602_BiTree/BiTree.cpp
index 116e5da..884761b 100644
--- a/Dev-C++/CourseBook/0602_BiTree/BiTree.cpp
+++ b/Dev-C++/CourseBook/0602_BiTree/BiTree.cpp
@@ -700,7 +700,7 @@ static Status PostTraverse(BiTree T, Status(Visit)(TElemType)) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/Dev-C++/CourseBook/0602_BiTree/BiTree.h b/Dev-C++/CourseBook/0602_BiTree/BiTree.h
index 0d85e87..61ea492 100644
--- a/Dev-C++/CourseBook/0602_BiTree/BiTree.h
+++ b/Dev-C++/CourseBook/0602_BiTree/BiTree.h
@@ -225,6 +225,6 @@ static Status PostTraverse(BiTree T, Status(Visit)(TElemType));
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/Dev-C++/CourseBook/0602_BiTree/TestData_Pre.txt b/Dev-C++/CourseBook/0602_BiTree/TestData_Pre.txt
index ca28844..3f8298f 100644
--- a/Dev-C++/CourseBook/0602_BiTree/TestData_Pre.txt
+++ b/Dev-C++/CourseBook/0602_BiTree/TestData_Pre.txt
@@ -1 +1 @@
-�������У����ϵ����Ǵ����ս�㣩��ABDG^^^EH^^I^^CF^J^^^
\ No newline at end of file
+�������У����ϵ����Ǵ����ս�㣩��ABDG^^^EH^^I^^CF^J^^^
diff --git a/Dev-C++/CourseBook/0602_BiTree/TestData_c1.txt b/Dev-C++/CourseBook/0602_BiTree/TestData_c1.txt
index a8a1f32..97dcfdc 100644
--- a/Dev-C++/CourseBook/0602_BiTree/TestData_c1.txt
+++ b/Dev-C++/CourseBook/0602_BiTree/TestData_c1.txt
@@ -1 +1 @@
-�������У����ϵ����Ǵ����ս�㣩��abc^^d^^^
\ No newline at end of file
+�������У����ϵ����Ǵ����ս�㣩��abc^^d^^^
diff --git a/Dev-C++/CourseBook/0602_BiTree/TestData_c2.txt b/Dev-C++/CourseBook/0602_BiTree/TestData_c2.txt
index c631228..d73dd8c 100644
--- a/Dev-C++/CourseBook/0602_BiTree/TestData_c2.txt
+++ b/Dev-C++/CourseBook/0602_BiTree/TestData_c2.txt
@@ -1 +1 @@
-�������У����ϵ����Ǵ����ս�㣩��12^3^^^
\ No newline at end of file
+�������У����ϵ����Ǵ����ս�㣩��12^3^^^
diff --git a/Dev-C++/CourseBook/0603_BiTriTree/BiTriTree-main.cpp b/Dev-C++/CourseBook/0603_BiTriTree/BiTriTree-main.cpp
index 519c50f..3533f67 100644
--- a/Dev-C++/CourseBook/0603_BiTriTree/BiTriTree-main.cpp
+++ b/Dev-C++/CourseBook/0603_BiTriTree/BiTriTree-main.cpp
@@ -34,10 +34,10 @@ int main(int argc, char* argv[]) {
     PressEnterToContinue();
     
     
-    printf("���������������� PrintGraph \n");
+    printf("���������������� PrintTree \n");
     {
         printf("�� ���������Ľṹ��ӡ�� T ...\n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -88,7 +88,7 @@ int main(int argc, char* argv[]) {
         TElemType value = 'X';
         printf("�� ����� %c ��ֵΪ %c ��T = \n", e, value);
         Assign(T, e, value);
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -141,20 +141,20 @@ int main(int argc, char* argv[]) {
         printf("�� �������� c1 ...\n");
         InitBiTree(&c1);
         CreateBiTree(&c1, "TestData_c1.txt");
-        PrintGraph(c1);
+        PrintTree(c1);
         
         printf("�� �������� c2 ...\n");
         InitBiTree(&c2);
         CreateBiTree(&c2, "TestData_c2.txt");
-        PrintGraph(c2);
+        PrintTree(c2);
         
         printf("�� ������ c1 ���������� T �� %c ���������� ...\n", p1);
         InsertChild(T, p1, 1, c1);
-        PrintGraph(T);
+        PrintTree(T);
         
         printf("�� ������ c2 ���������� T �� %c ���������� ...\n", p2);
         InsertChild(T, p2, 0, c2);
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -166,11 +166,11 @@ int main(int argc, char* argv[]) {
         
         printf("�� ɾ�������� T �� %c ���������� ...\n", p1);
         DeleteChild(T, p1, 1);
-        PrintGraph(T);
+        PrintTree(T);
         
         printf("�� ɾ�������� T �� %c ���������� ...\n", p2);
         DeleteChild(T, p2, 0);
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
diff --git a/Dev-C++/CourseBook/0603_BiTriTree/BiTriTree.cpp b/Dev-C++/CourseBook/0603_BiTriTree/BiTriTree.cpp
index 500d5ff..c65a2f2 100644
--- a/Dev-C++/CourseBook/0603_BiTriTree/BiTriTree.cpp
+++ b/Dev-C++/CourseBook/0603_BiTriTree/BiTriTree.cpp
@@ -602,7 +602,7 @@ static Status PostTraverse(BiTriTree T, Status(Visit)(TElemType)) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTriTree T) {
+void PrintTree(BiTriTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/Dev-C++/CourseBook/0603_BiTriTree/BiTriTree.h b/Dev-C++/CourseBook/0603_BiTriTree/BiTriTree.h
index 07de558..7668a7e 100644
--- a/Dev-C++/CourseBook/0603_BiTriTree/BiTriTree.h
+++ b/Dev-C++/CourseBook/0603_BiTriTree/BiTriTree.h
@@ -201,6 +201,6 @@ static Status PostTraverse(BiTriTree T, Status(Visit)(TElemType));
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTriTree T);
+void PrintTree(BiTriTree T);
 
 #endif
diff --git a/Dev-C++/CourseBook/0603_BiTriTree/TestData_Pre.txt b/Dev-C++/CourseBook/0603_BiTriTree/TestData_Pre.txt
index ca28844..3f8298f 100644
--- a/Dev-C++/CourseBook/0603_BiTriTree/TestData_Pre.txt
+++ b/Dev-C++/CourseBook/0603_BiTriTree/TestData_Pre.txt
@@ -1 +1 @@
-�������У����ϵ����Ǵ����ս�㣩��ABDG^^^EH^^I^^CF^J^^^
\ No newline at end of file
+�������У����ϵ����Ǵ����ս�㣩��ABDG^^^EH^^I^^CF^J^^^
diff --git a/Dev-C++/CourseBook/0603_BiTriTree/TestData_c1.txt b/Dev-C++/CourseBook/0603_BiTriTree/TestData_c1.txt
index a8a1f32..97dcfdc 100644
--- a/Dev-C++/CourseBook/0603_BiTriTree/TestData_c1.txt
+++ b/Dev-C++/CourseBook/0603_BiTriTree/TestData_c1.txt
@@ -1 +1 @@
-�������У����ϵ����Ǵ����ս�㣩��abc^^d^^^
\ No newline at end of file
+�������У����ϵ����Ǵ����ս�㣩��abc^^d^^^
diff --git a/Dev-C++/CourseBook/0603_BiTriTree/TestData_c2.txt b/Dev-C++/CourseBook/0603_BiTriTree/TestData_c2.txt
index c631228..d73dd8c 100644
--- a/Dev-C++/CourseBook/0603_BiTriTree/TestData_c2.txt
+++ b/Dev-C++/CourseBook/0603_BiTriTree/TestData_c2.txt
@@ -1 +1 @@
-�������У����ϵ����Ǵ����ս�㣩��12^3^^^
\ No newline at end of file
+�������У����ϵ����Ǵ����ս�㣩��12^3^^^
diff --git a/Dev-C++/CourseBook/0605_PTree/PTree-main.cpp b/Dev-C++/CourseBook/0605_PTree/PTree-main.cpp
index 024e24b..aeeefad 100644
--- a/Dev-C++/CourseBook/0605_PTree/PTree-main.cpp
+++ b/Dev-C++/CourseBook/0605_PTree/PTree-main.cpp
@@ -35,11 +35,11 @@ int main(int argc, char* argv[]) {
     PressEnterToContinue();
     
     
-    printf("���������������� PrintGraph \n");
+    printf("���������������� PrintTree \n");
     {
         printf("�� �����Ľṹ��ӡ�� T ...\n");
         printf("�� T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -83,7 +83,7 @@ int main(int argc, char* argv[]) {
         printf("�� ����� %c ��ֵΪ %c ...\n", e, value);
         Assign(&T, e, value);
         printf("�� T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -146,12 +146,12 @@ int main(int argc, char* argv[]) {
         InitTree(&c);
         CreateTree(&c, "TestData_c.txt");
         printf("�� c = \n");
-        PrintGraph(c);
+        PrintTree(c);
         
         printf("�� ������ c ����Ϊ�� T �� %c ���ĵ� %d ������ ...\n", p, i);
         InsertChild(&T, p, i, c);
         printf("�� T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -164,7 +164,7 @@ int main(int argc, char* argv[]) {
         printf("�� ɾ���� T �� %c ���ĵ� %d ������ ...\n", p, i);
         DeleteChild(&T, p, i);
         printf("�� T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
diff --git a/Dev-C++/CourseBook/0605_PTree/PTree.cpp b/Dev-C++/CourseBook/0605_PTree/PTree.cpp
index 4794b39..ee1e32d 100644
--- a/Dev-C++/CourseBook/0605_PTree/PTree.cpp
+++ b/Dev-C++/CourseBook/0605_PTree/PTree.cpp
@@ -1068,7 +1068,7 @@ static void printPos(PTree T, Pos pt[]) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(PTree T) {
+void PrintTree(PTree T) {
     Pos pt[MAX_TREE_SIZE];
     
     // ���������������������
diff --git a/Dev-C++/CourseBook/0605_PTree/PTree.h b/Dev-C++/CourseBook/0605_PTree/PTree.h
index 57c2666..2636b3e 100644
--- a/Dev-C++/CourseBook/0605_PTree/PTree.h
+++ b/Dev-C++/CourseBook/0605_PTree/PTree.h
@@ -231,7 +231,7 @@ static void printPos(PTree T, Pos pt[]);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(PTree T);
+void PrintTree(PTree T);
 
 // ͼ�λ������ǰ�ṹ�ڲ�ʵ��
 static void Print(PTree T, Pos pt[], int i);
diff --git a/Dev-C++/CourseBook/0605_PTree/TestData_T.txt b/Dev-C++/CourseBook/0605_PTree/TestData_T.txt
index 5786a62..ad6fff9 100644
--- a/Dev-C++/CourseBook/0605_PTree/TestData_T.txt
+++ b/Dev-C++/CourseBook/0605_PTree/TestData_T.txt
@@ -9,4 +9,4 @@ E
 F�ĺ��ӽ�㣺GHK
 G�ĺ��ӽ�㣺^
 H�ĺ��ӽ�㣺^
-K�ĺ��ӽ�㣺^
\ No newline at end of file
+K�ĺ��ӽ�㣺^
diff --git a/Dev-C++/CourseBook/0605_PTree/TestData_c.txt b/Dev-C++/CourseBook/0605_PTree/TestData_c.txt
index 81ede16..c67e13f 100644
--- a/Dev-C++/CourseBook/0605_PTree/TestData_c.txt
+++ b/Dev-C++/CourseBook/0605_PTree/TestData_c.txt
@@ -5,4 +5,4 @@ P
 Q�ĺ��ӽ�㣺UVW
 U�ĺ��ӽ�㣺^
 V�ĺ��ӽ�㣺^
-W�ĺ��ӽ�㣺^
\ No newline at end of file
+W�ĺ��ӽ�㣺^
diff --git a/Dev-C++/CourseBook/0606_CTree/CTree-main.cpp b/Dev-C++/CourseBook/0606_CTree/CTree-main.cpp
index 57317a1..047ad9a 100644
--- a/Dev-C++/CourseBook/0606_CTree/CTree-main.cpp
+++ b/Dev-C++/CourseBook/0606_CTree/CTree-main.cpp
@@ -35,11 +35,11 @@ int main(int argc, char* argv[]) {
     PressEnterToContinue();
     
     
-    printf("���������������� PrintGraph \n");
+    printf("���������������� PrintTree \n");
     {
         printf("�� �����Ľṹ��ӡ�� T ...\n");
         printf("�� T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -83,7 +83,7 @@ int main(int argc, char* argv[]) {
         printf("�� ����� %c ��ֵΪ %c ...\n", e, value);
         Assign(&T, e, value);
         printf("�� T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -146,12 +146,12 @@ int main(int argc, char* argv[]) {
         InitTree(&c);
         CreateTree(&c, "TestData_c.txt");
         printf("�� c = \n");
-        PrintGraph(c);
+        PrintTree(c);
         
         printf("�� ������ c ����Ϊ�� T �� %c ���ĵ� %d ������ ...\n", p, i);
         InsertChild(&T, p, i, c);
         printf("�� T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -164,7 +164,7 @@ int main(int argc, char* argv[]) {
         printf("�� ɾ���� T �� %c ���ĵ� %d ������ ...\n", p, i);
         DeleteChild(&T, p, i);
         printf("�� T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
diff --git a/Dev-C++/CourseBook/0606_CTree/CTree.cpp b/Dev-C++/CourseBook/0606_CTree/CTree.cpp
index d5540fd..8a5afc5 100644
--- a/Dev-C++/CourseBook/0606_CTree/CTree.cpp
+++ b/Dev-C++/CourseBook/0606_CTree/CTree.cpp
@@ -1259,7 +1259,7 @@ static void printPos(CTree T, Pos pt[]) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CTree T) {
+void PrintTree(CTree T) {
     Pos pt[MAX_TREE_SIZE];
     
     // ���������������������
diff --git a/Dev-C++/CourseBook/0606_CTree/CTree.h b/Dev-C++/CourseBook/0606_CTree/CTree.h
index 652adcf..9f4e308 100644
--- a/Dev-C++/CourseBook/0606_CTree/CTree.h
+++ b/Dev-C++/CourseBook/0606_CTree/CTree.h
@@ -243,7 +243,7 @@ static void printPos(CTree T, Pos pt[]);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CTree T);
+void PrintTree(CTree T);
 
 // ͼ�λ������ǰ�ṹ�ڲ�ʵ��
 static void Print(CTree T, Pos pt[], int i);
diff --git a/Dev-C++/CourseBook/0606_CTree/TestData_T.txt b/Dev-C++/CourseBook/0606_CTree/TestData_T.txt
index 5786a62..ad6fff9 100644
--- a/Dev-C++/CourseBook/0606_CTree/TestData_T.txt
+++ b/Dev-C++/CourseBook/0606_CTree/TestData_T.txt
@@ -9,4 +9,4 @@ E
 F�ĺ��ӽ�㣺GHK
 G�ĺ��ӽ�㣺^
 H�ĺ��ӽ�㣺^
-K�ĺ��ӽ�㣺^
\ No newline at end of file
+K�ĺ��ӽ�㣺^
diff --git a/Dev-C++/CourseBook/0606_CTree/TestData_c.txt b/Dev-C++/CourseBook/0606_CTree/TestData_c.txt
index 81ede16..c67e13f 100644
--- a/Dev-C++/CourseBook/0606_CTree/TestData_c.txt
+++ b/Dev-C++/CourseBook/0606_CTree/TestData_c.txt
@@ -5,4 +5,4 @@ P
 Q�ĺ��ӽ�㣺UVW
 U�ĺ��ӽ�㣺^
 V�ĺ��ӽ�㣺^
-W�ĺ��ӽ�㣺^
\ No newline at end of file
+W�ĺ��ӽ�㣺^
diff --git a/Dev-C++/CourseBook/0607_CSTree/CSTree-main.cpp b/Dev-C++/CourseBook/0607_CSTree/CSTree-main.cpp
index 5b96335..5b3864c 100644
--- a/Dev-C++/CourseBook/0607_CSTree/CSTree-main.cpp
+++ b/Dev-C++/CourseBook/0607_CSTree/CSTree-main.cpp
@@ -35,11 +35,11 @@ int main(int argc, char* argv[]) {
     PressEnterToContinue();
     
     
-    printf("���������������� PrintGraph \n");
+    printf("���������������� PrintTree \n");
     {
         printf("�� �����Ľṹ��ӡ�� T ...\n");
         printf("�� T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -83,7 +83,7 @@ int main(int argc, char* argv[]) {
         printf("�� ����� %c ��ֵΪ %c ...\n", e, value);
         Assign(T, e, value);
         printf("�� T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -146,12 +146,12 @@ int main(int argc, char* argv[]) {
         InitTree(&c);
         CreateTree(&c, "TestData_c.txt");
         printf("�� c = \n");
-        PrintGraph(c);
+        PrintTree(c);
         
         printf("�� ������ c ����Ϊ�� T �� %c ���ĵ� %d ������ ...\n", p, i);
         InsertChild(&T, p, i, c);
         printf("�� T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -164,7 +164,7 @@ int main(int argc, char* argv[]) {
         printf("�� ɾ���� T �� %c ���ĵ� %d ������ ...\n", p, i);
         DeleteChild(&T, p, i);
         printf("�� T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
diff --git a/Dev-C++/CourseBook/0607_CSTree/CSTree.cpp b/Dev-C++/CourseBook/0607_CSTree/CSTree.cpp
index 6f8b140..dc6a579 100644
--- a/Dev-C++/CourseBook/0607_CSTree/CSTree.cpp
+++ b/Dev-C++/CourseBook/0607_CSTree/CSTree.cpp
@@ -678,7 +678,7 @@ static Status PostTraverse(CSTree T, Status(Visit)(TElemType)) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CSTree T) {
+void PrintTree(CSTree T) {
     
     // ���������������������
     if(TreeEmpty(T)) {
diff --git a/Dev-C++/CourseBook/0607_CSTree/CSTree.h b/Dev-C++/CourseBook/0607_CSTree/CSTree.h
index f135be6..49bf526 100644
--- a/Dev-C++/CourseBook/0607_CSTree/CSTree.h
+++ b/Dev-C++/CourseBook/0607_CSTree/CSTree.h
@@ -196,7 +196,7 @@ static Status PostTraverse(CSTree T, Status(Visit)(TElemType));
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CSTree T);
+void PrintTree(CSTree T);
 
 // ͼ�λ������ǰ�ṹ�ڲ�ʵ��
 static void Print(CSTree T, int row);
diff --git a/Dev-C++/CourseBook/0607_CSTree/TestData_T.txt b/Dev-C++/CourseBook/0607_CSTree/TestData_T.txt
index 0b1431c..5be89f1 100644
--- a/Dev-C++/CourseBook/0607_CSTree/TestData_T.txt
+++ b/Dev-C++/CourseBook/0607_CSTree/TestData_T.txt
@@ -1 +1 @@
-RAD^E^^B^CFG^H^K^^^^^
\ No newline at end of file
+RAD^E^^B^CFG^H^K^^^^^
diff --git a/Dev-C++/CourseBook/0607_CSTree/TestData_c.txt b/Dev-C++/CourseBook/0607_CSTree/TestData_c.txt
index 422f006..0558331 100644
--- a/Dev-C++/CourseBook/0607_CSTree/TestData_c.txt
+++ b/Dev-C++/CourseBook/0607_CSTree/TestData_c.txt
@@ -1 +1 @@
-OP^QU^V^W^^^^
\ No newline at end of file
+OP^QU^V^W^^^^
diff --git a/Dev-C++/CourseBook/0608_MFSet/MFSet-main.cpp b/Dev-C++/CourseBook/0608_MFSet/MFSet-main.cpp
index 5874ae7..2a4ac2f 100644
--- a/Dev-C++/CourseBook/0608_MFSet/MFSet-main.cpp
+++ b/Dev-C++/CourseBook/0608_MFSet/MFSet-main.cpp
@@ -31,10 +31,10 @@ int main(int argc, char* argv[]) {
     PressEnterToContinue();
     
     
-    printf("���������������� PrintGraph \n");
+    printf("���������������� PrintSet \n");
     {
         printf("�� ������� S ...\n");
-        PrintGraph(S);
+        PrintSet(S);
     }
     PressEnterToContinue();
     
@@ -47,7 +47,7 @@ int main(int argc, char* argv[]) {
         PrintRelation(R1);
 
         printf("�� ������� S ...\n");
-        PrintGraph(S);
+        PrintSet(S);
 
 
         printf("�� �Լ���Ӧ�ö�Ԫ��ϵ R2�� ");
@@ -55,7 +55,7 @@ int main(int argc, char* argv[]) {
         PrintRelation(R2);
 
         printf("�� ������� S ...\n");
-        PrintGraph(S);
+        PrintSet(S);
     }
     PressEnterToContinue();
     
@@ -68,7 +68,7 @@ int main(int argc, char* argv[]) {
 //        PrintRelation(R1);
 //
 //        printf("�� ������� S ...\n");
-//        PrintGraph(S);
+//        PrintSet(S);
 //
 //
 //        printf("�� �Լ���Ӧ�ö�Ԫ��ϵ R2�� ");
@@ -76,7 +76,7 @@ int main(int argc, char* argv[]) {
 //        PrintRelation(R2);
 //
 //        printf("�� ������� S ...\n");
-//        PrintGraph(S);
+//        PrintSet(S);
 //    }
 //    PressEnterToContinue();
     
diff --git a/Dev-C++/CourseBook/0608_MFSet/MFSet.cpp b/Dev-C++/CourseBook/0608_MFSet/MFSet.cpp
index 7f53c4d..42822d8 100644
--- a/Dev-C++/CourseBook/0608_MFSet/MFSet.cpp
+++ b/Dev-C++/CourseBook/0608_MFSet/MFSet.cpp
@@ -289,7 +289,7 @@ static void relation(Relation* R, FILE* fp) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(MFSet S) {
+void PrintSet(MFSet S) {
     typedef struct Elem {
         int x;
         struct Elem* next;
diff --git a/Dev-C++/CourseBook/0608_MFSet/MFSet.h b/Dev-C++/CourseBook/0608_MFSet/MFSet.h
index 2c9d401..b0db64b 100644
--- a/Dev-C++/CourseBook/0608_MFSet/MFSet.h
+++ b/Dev-C++/CourseBook/0608_MFSet/MFSet.h
@@ -155,7 +155,7 @@ static void relation(Relation* R, FILE* fp);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ����
-void PrintGraph(MFSet S);
+void PrintSet(MFSet S);
 
 // ͼ�λ�����������нṹ�������ڲ�����ʹ��
 static void PrintFramework(MFSet S);
diff --git a/Dev-C++/CourseBook/0608_MFSet/TestData_R1.txt b/Dev-C++/CourseBook/0608_MFSet/TestData_R1.txt
index c3ebc43..f737f91 100644
--- a/Dev-C++/CourseBook/0608_MFSet/TestData_R1.txt
+++ b/Dev-C++/CourseBook/0608_MFSet/TestData_R1.txt
@@ -1,2 +1,2 @@
 ��Ԫ��ϵ��������4
-�ȼ۹�ϵ��(1,2) (3,4) (5,6) (7,9)
\ No newline at end of file
+�ȼ۹�ϵ��(1,2) (3,4) (5,6) (7,9)
diff --git a/Dev-C++/CourseBook/0608_MFSet/TestData_R2.txt b/Dev-C++/CourseBook/0608_MFSet/TestData_R2.txt
index 05ef6f0..c9beb76 100644
--- a/Dev-C++/CourseBook/0608_MFSet/TestData_R2.txt
+++ b/Dev-C++/CourseBook/0608_MFSet/TestData_R2.txt
@@ -1,2 +1,2 @@
 �ȼ۹�ϵ��������2
-�ȼ۹�ϵ��(1,3) (5,7)
\ No newline at end of file
+�ȼ۹�ϵ��(1,3) (5,7)
diff --git a/Dev-C++/CourseBook/0608_MFSet/TestData_S.txt b/Dev-C++/CourseBook/0608_MFSet/TestData_S.txt
index 27cbf0e..82c2b53 100644
--- a/Dev-C++/CourseBook/0608_MFSet/TestData_S.txt
+++ b/Dev-C++/CourseBook/0608_MFSet/TestData_S.txt
@@ -1 +1 @@
-����Ԫ�ظ�����10
\ No newline at end of file
+����Ԫ�ظ�����10
diff --git a/Dev-C++/ExerciseBook/05.28-05.29/05.28-05.29.cpp b/Dev-C++/ExerciseBook/05.28-05.29/05.28-05.29.cpp
index eb0a701..342eb2b 100644
--- a/Dev-C++/ExerciseBook/05.28-05.29/05.28-05.29.cpp
+++ b/Dev-C++/ExerciseBook/05.28-05.29/05.28-05.29.cpp
@@ -41,23 +41,23 @@ int main(int argc, char* argv[]) {
     printf("������Ԫ����ʽ...\n");
     CreateMPList(&P, p, "zyx");
     printf("P = ");
-    PrintGraph(P);
+    PrintMPList(P);
     CreateMPList(&Q, q, "zyx");
     printf("Q = ");
-    PrintGraph(Q);
+    PrintMPList(Q);
     
     // ���һԪ��ƫ����
     printf("P' = ");
     Algo_5_28(P, &PD);
-    PrintGraph(PD);
+    PrintMPList(PD);
     printf("Q' = ");
     Algo_5_28(Q, &QD);
-    PrintGraph(QD);
+    PrintMPList(QD);
 
     // ����ʽ�ӷ�
     printf("R = ");
     Algo_5_29(P, Q, &R);
-    PrintGraph(R);
+    PrintMPList(R);
 }
 
 
diff --git a/Dev-C++/ExerciseBook/05.28-05.29/MPList.cpp b/Dev-C++/ExerciseBook/05.28-05.29/MPList.cpp
index 1f08b74..5f66de6 100644
--- a/Dev-C++/ExerciseBook/05.28-05.29/MPList.cpp
+++ b/Dev-C++/ExerciseBook/05.28-05.29/MPList.cpp
@@ -111,7 +111,7 @@ static Status Create(MPList* P, char* S) {
  *
  * ���������mԪ����P��
  */
-void PrintGraph(MPList P) {
+void PrintMPList(MPList P) {
     if(P == NULL) {
         printf("\n");
         return;
diff --git a/Dev-C++/ExerciseBook/05.28-05.29/MPList.h b/Dev-C++/ExerciseBook/05.28-05.29/MPList.h
index 455e7ea..5c781f9 100644
--- a/Dev-C++/ExerciseBook/05.28-05.29/MPList.h
+++ b/Dev-C++/ExerciseBook/05.28-05.29/MPList.h
@@ -72,7 +72,7 @@ static Status Create(MPList* P, char* S);
  *
  * ���������mԪ����P��
  */
-void PrintGraph(MPList P);
+void PrintMPList(MPList P);
 
 /*
  * ͼ�λ�������ڲ�ʵ��
diff --git a/Dev-C++/ExerciseBook/05.30.1/05.30.1.cpp b/Dev-C++/ExerciseBook/05.30.1/05.30.1.cpp
index 00aefcc..4215515 100644
--- a/Dev-C++/ExerciseBook/05.30.1/05.30.1.cpp
+++ b/Dev-C++/ExerciseBook/05.30.1/05.30.1.cpp
@@ -15,7 +15,7 @@ int main(int argc, char* argv[]) {
     StrAssign(S, s);
     CreateGList(&L, S);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     printf("���������� %d\n", Algo_5_30_1(L));
     
diff --git a/Dev-C++/ExerciseBook/05.30.1/GList-HT.cpp b/Dev-C++/ExerciseBook/05.30.1/GList-HT.cpp
index bad30df..a761587 100644
--- a/Dev-C++/ExerciseBook/05.30.1/GList-HT.cpp
+++ b/Dev-C++/ExerciseBook/05.30.1/GList-HT.cpp
@@ -335,7 +335,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * ��������������L��
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L, Head);
     printf("\n");
 }
diff --git a/Dev-C++/ExerciseBook/05.30.1/GList-HT.h b/Dev-C++/ExerciseBook/05.30.1/GList-HT.h
index 508b96f..bc90362 100644
--- a/Dev-C++/ExerciseBook/05.30.1/GList-HT.h
+++ b/Dev-C++/ExerciseBook/05.30.1/GList-HT.h
@@ -143,7 +143,7 @@ void Traverse(GList L, void (Visit)(AtomType));
  *
  * ��������������L��
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * ͼ�λ�������ڲ�ʵ�֣�mark��ͼ�λ������ǡ�
diff --git a/Dev-C++/ExerciseBook/05.30.2/05.30.2.cpp b/Dev-C++/ExerciseBook/05.30.2/05.30.2.cpp
index 929561f..d45676d 100644
--- a/Dev-C++/ExerciseBook/05.30.2/05.30.2.cpp
+++ b/Dev-C++/ExerciseBook/05.30.2/05.30.2.cpp
@@ -15,7 +15,7 @@ int main(int argc, char* argv[]) {
     StrAssign(S, s);
     CreateGList(&L, S);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     printf("���������� %d\n", Algo_5_30_2(L));
     
diff --git a/Dev-C++/ExerciseBook/05.30.2/GList-E.cpp b/Dev-C++/ExerciseBook/05.30.2/GList-E.cpp
index 3fc0ad9..e5b2ccb 100644
--- a/Dev-C++/ExerciseBook/05.30.2/GList-E.cpp
+++ b/Dev-C++/ExerciseBook/05.30.2/GList-E.cpp
@@ -370,7 +370,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * ��������������L��
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L);
     printf("\n");
 }
diff --git a/Dev-C++/ExerciseBook/05.30.2/GList-E.h b/Dev-C++/ExerciseBook/05.30.2/GList-E.h
index fa9af82..b2b002c 100644
--- a/Dev-C++/ExerciseBook/05.30.2/GList-E.h
+++ b/Dev-C++/ExerciseBook/05.30.2/GList-E.h
@@ -126,7 +126,7 @@ void Traverse(GList L, void(Visit)(AtomType));
  *
  * ��������������L��
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * ͼ�λ�������ڲ�ʵ�֡�
diff --git a/Dev-C++/ExerciseBook/05.31/05.31.cpp b/Dev-C++/ExerciseBook/05.31/05.31.cpp
index da70a36..c453261 100644
--- a/Dev-C++/ExerciseBook/05.31/05.31.cpp
+++ b/Dev-C++/ExerciseBook/05.31/05.31.cpp
@@ -21,12 +21,12 @@ int main(int argc, char* argv[]) {
     StrAssign(S, s);
     CreateGList(&L, S);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     printf("���ƹ������ L �� T...\n");
     Algo_5_31(&T, L);
     printf("T = ");
-    PrintGraph(T);
+    PrintGList(T);
     
     return 0;
 }
diff --git a/Dev-C++/ExerciseBook/05.31/GList-E.cpp b/Dev-C++/ExerciseBook/05.31/GList-E.cpp
index 3fc0ad9..e5b2ccb 100644
--- a/Dev-C++/ExerciseBook/05.31/GList-E.cpp
+++ b/Dev-C++/ExerciseBook/05.31/GList-E.cpp
@@ -370,7 +370,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * ��������������L��
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L);
     printf("\n");
 }
diff --git a/Dev-C++/ExerciseBook/05.31/GList-E.h b/Dev-C++/ExerciseBook/05.31/GList-E.h
index fa9af82..b2b002c 100644
--- a/Dev-C++/ExerciseBook/05.31/GList-E.h
+++ b/Dev-C++/ExerciseBook/05.31/GList-E.h
@@ -126,7 +126,7 @@ void Traverse(GList L, void(Visit)(AtomType));
  *
  * ��������������L��
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * ͼ�λ�������ڲ�ʵ�֡�
diff --git a/Dev-C++/ExerciseBook/05.32.1/05.32.1.cpp b/Dev-C++/ExerciseBook/05.32.1/05.32.1.cpp
index 49d7e91..e5b114d 100644
--- a/Dev-C++/ExerciseBook/05.32.1/05.32.1.cpp
+++ b/Dev-C++/ExerciseBook/05.32.1/05.32.1.cpp
@@ -21,9 +21,9 @@ int main(int argc, char* argv[]) {
     StrAssign(Sb, b);
     CreateGList(&B, Sb);
     printf("A = ");
-    PrintGraph(A);
+    PrintGList(A);
     printf("B = ");
-    PrintGraph(B);
+    PrintGList(B);
     
     Algo_5_32_1(A, B) ? printf("���������ȣ�\n") : printf("�����������ȣ���\n");
     
diff --git a/Dev-C++/ExerciseBook/05.32.1/GList-HT.cpp b/Dev-C++/ExerciseBook/05.32.1/GList-HT.cpp
index bad30df..a761587 100644
--- a/Dev-C++/ExerciseBook/05.32.1/GList-HT.cpp
+++ b/Dev-C++/ExerciseBook/05.32.1/GList-HT.cpp
@@ -335,7 +335,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * ��������������L��
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L, Head);
     printf("\n");
 }
diff --git a/Dev-C++/ExerciseBook/05.32.1/GList-HT.h b/Dev-C++/ExerciseBook/05.32.1/GList-HT.h
index 508b96f..bc90362 100644
--- a/Dev-C++/ExerciseBook/05.32.1/GList-HT.h
+++ b/Dev-C++/ExerciseBook/05.32.1/GList-HT.h
@@ -143,7 +143,7 @@ void Traverse(GList L, void (Visit)(AtomType));
  *
  * ��������������L��
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * ͼ�λ�������ڲ�ʵ�֣�mark��ͼ�λ������ǡ�
diff --git a/Dev-C++/ExerciseBook/05.32.2/05.32.2.cpp b/Dev-C++/ExerciseBook/05.32.2/05.32.2.cpp
index adc2453..017ee2c 100644
--- a/Dev-C++/ExerciseBook/05.32.2/05.32.2.cpp
+++ b/Dev-C++/ExerciseBook/05.32.2/05.32.2.cpp
@@ -21,9 +21,9 @@ int main(int argc, char* argv[]) {
     StrAssign(Sb, b);
     CreateGList(&B, Sb);
     printf("A = ");
-    PrintGraph(A);
+    PrintGList(A);
     printf("B = ");
-    PrintGraph(B);
+    PrintGList(B);
     
     Algo_5_32_2(A, B) ? printf("���������ȣ�\n") : printf("�����������ȣ���\n");
     
diff --git a/Dev-C++/ExerciseBook/05.32.2/GList-E.cpp b/Dev-C++/ExerciseBook/05.32.2/GList-E.cpp
index 3fc0ad9..e5b2ccb 100644
--- a/Dev-C++/ExerciseBook/05.32.2/GList-E.cpp
+++ b/Dev-C++/ExerciseBook/05.32.2/GList-E.cpp
@@ -370,7 +370,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * ��������������L��
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L);
     printf("\n");
 }
diff --git a/Dev-C++/ExerciseBook/05.32.2/GList-E.h b/Dev-C++/ExerciseBook/05.32.2/GList-E.h
index fa9af82..b2b002c 100644
--- a/Dev-C++/ExerciseBook/05.32.2/GList-E.h
+++ b/Dev-C++/ExerciseBook/05.32.2/GList-E.h
@@ -126,7 +126,7 @@ void Traverse(GList L, void(Visit)(AtomType));
  *
  * ��������������L��
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * ͼ�λ�������ڲ�ʵ�֡�
diff --git a/Dev-C++/ExerciseBook/05.33.1/05.33.1.cpp b/Dev-C++/ExerciseBook/05.33.1/05.33.1.cpp
index 0ee6f53..b8ab343 100644
--- a/Dev-C++/ExerciseBook/05.33.1/05.33.1.cpp
+++ b/Dev-C++/ExerciseBook/05.33.1/05.33.1.cpp
@@ -17,7 +17,7 @@ int main(int argc, char* argv[]) {
     StrAssign(S, s);
     CreateGList(&L, S);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     Algo_5_33_1(L, 0);
     
diff --git a/Dev-C++/ExerciseBook/05.33.1/GList-HT.cpp b/Dev-C++/ExerciseBook/05.33.1/GList-HT.cpp
index bad30df..a761587 100644
--- a/Dev-C++/ExerciseBook/05.33.1/GList-HT.cpp
+++ b/Dev-C++/ExerciseBook/05.33.1/GList-HT.cpp
@@ -335,7 +335,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * ��������������L��
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L, Head);
     printf("\n");
 }
diff --git a/Dev-C++/ExerciseBook/05.33.1/GList-HT.h b/Dev-C++/ExerciseBook/05.33.1/GList-HT.h
index 508b96f..bc90362 100644
--- a/Dev-C++/ExerciseBook/05.33.1/GList-HT.h
+++ b/Dev-C++/ExerciseBook/05.33.1/GList-HT.h
@@ -143,7 +143,7 @@ void Traverse(GList L, void (Visit)(AtomType));
  *
  * ��������������L��
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * ͼ�λ�������ڲ�ʵ�֣�mark��ͼ�λ������ǡ�
diff --git a/Dev-C++/ExerciseBook/05.33.2/05.33.2.cpp b/Dev-C++/ExerciseBook/05.33.2/05.33.2.cpp
index 11aa567..25dbee3 100644
--- a/Dev-C++/ExerciseBook/05.33.2/05.33.2.cpp
+++ b/Dev-C++/ExerciseBook/05.33.2/05.33.2.cpp
@@ -17,7 +17,7 @@ int main(int argc, char* argv[]) {
     StrAssign(S, s);
     CreateGList(&L, S);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     Algo_5_33_2(L, 0);
     
diff --git a/Dev-C++/ExerciseBook/05.33.2/GList-E.cpp b/Dev-C++/ExerciseBook/05.33.2/GList-E.cpp
index 3fc0ad9..e5b2ccb 100644
--- a/Dev-C++/ExerciseBook/05.33.2/GList-E.cpp
+++ b/Dev-C++/ExerciseBook/05.33.2/GList-E.cpp
@@ -370,7 +370,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * ��������������L��
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L);
     printf("\n");
 }
diff --git a/Dev-C++/ExerciseBook/05.33.2/GList-E.h b/Dev-C++/ExerciseBook/05.33.2/GList-E.h
index fa9af82..b2b002c 100644
--- a/Dev-C++/ExerciseBook/05.33.2/GList-E.h
+++ b/Dev-C++/ExerciseBook/05.33.2/GList-E.h
@@ -126,7 +126,7 @@ void Traverse(GList L, void(Visit)(AtomType));
  *
  * ��������������L��
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * ͼ�λ�������ڲ�ʵ�֡�
diff --git a/Dev-C++/ExerciseBook/05.34.1/05.34.1.cpp b/Dev-C++/ExerciseBook/05.34.1/05.34.1.cpp
index b3a2013..014f69b 100644
--- a/Dev-C++/ExerciseBook/05.34.1/05.34.1.cpp
+++ b/Dev-C++/ExerciseBook/05.34.1/05.34.1.cpp
@@ -18,12 +18,12 @@ int main(int argc, char* argv[]) {
     StrAssign(S, s);
     CreateGList(&L, S);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     printf("���ù����...\n");
     Algo_5_34_1(&L);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     return 0;
 }
diff --git a/Dev-C++/ExerciseBook/05.34.1/GList-HT.cpp b/Dev-C++/ExerciseBook/05.34.1/GList-HT.cpp
index bad30df..a761587 100644
--- a/Dev-C++/ExerciseBook/05.34.1/GList-HT.cpp
+++ b/Dev-C++/ExerciseBook/05.34.1/GList-HT.cpp
@@ -335,7 +335,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * ��������������L��
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L, Head);
     printf("\n");
 }
diff --git a/Dev-C++/ExerciseBook/05.34.1/GList-HT.h b/Dev-C++/ExerciseBook/05.34.1/GList-HT.h
index 508b96f..bc90362 100644
--- a/Dev-C++/ExerciseBook/05.34.1/GList-HT.h
+++ b/Dev-C++/ExerciseBook/05.34.1/GList-HT.h
@@ -143,7 +143,7 @@ void Traverse(GList L, void (Visit)(AtomType));
  *
  * ��������������L��
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * ͼ�λ�������ڲ�ʵ�֣�mark��ͼ�λ������ǡ�
diff --git a/Dev-C++/ExerciseBook/05.34.2/05.34.2.cpp b/Dev-C++/ExerciseBook/05.34.2/05.34.2.cpp
index c72e80d..39249be 100644
--- a/Dev-C++/ExerciseBook/05.34.2/05.34.2.cpp
+++ b/Dev-C++/ExerciseBook/05.34.2/05.34.2.cpp
@@ -18,12 +18,12 @@ int main(int argc, char* argv[]) {
     StrAssign(S, s);
     CreateGList(&L, S);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     printf("���ù����...\n");
     Algo_5_34_2(&L);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     return 0;
 }
diff --git a/Dev-C++/ExerciseBook/05.34.2/GList-E.cpp b/Dev-C++/ExerciseBook/05.34.2/GList-E.cpp
index 3fc0ad9..e5b2ccb 100644
--- a/Dev-C++/ExerciseBook/05.34.2/GList-E.cpp
+++ b/Dev-C++/ExerciseBook/05.34.2/GList-E.cpp
@@ -370,7 +370,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * ��������������L��
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L);
     printf("\n");
 }
diff --git a/Dev-C++/ExerciseBook/05.34.2/GList-E.h b/Dev-C++/ExerciseBook/05.34.2/GList-E.h
index fa9af82..b2b002c 100644
--- a/Dev-C++/ExerciseBook/05.34.2/GList-E.h
+++ b/Dev-C++/ExerciseBook/05.34.2/GList-E.h
@@ -126,7 +126,7 @@ void Traverse(GList L, void(Visit)(AtomType));
  *
  * ��������������L��
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * ͼ�λ�������ڲ�ʵ�֡�
diff --git a/Dev-C++/ExerciseBook/05.35-05.36/05.35-05.36.cpp b/Dev-C++/ExerciseBook/05.35-05.36/05.35-05.36.cpp
index 615ee5e..f7da4b3 100644
--- a/Dev-C++/ExerciseBook/05.35-05.36/05.35-05.36.cpp
+++ b/Dev-C++/ExerciseBook/05.35-05.36/05.35-05.36.cpp
@@ -41,5 +41,5 @@ Status Algo_5_35(GList* L, SString S) {
  * ��������������L�����ｫ"( )"����Ϊ�����Ϊ�յ�״̬��
  */
 void Algo_5_36(GList L) {
-    PrintGraph(L);
+    PrintGList(L);
 }
diff --git a/Dev-C++/ExerciseBook/05.35-05.36/GList.cpp b/Dev-C++/ExerciseBook/05.35-05.36/GList.cpp
index 3956155..efefa10 100644
--- a/Dev-C++/ExerciseBook/05.35-05.36/GList.cpp
+++ b/Dev-C++/ExerciseBook/05.35-05.36/GList.cpp
@@ -96,7 +96,7 @@ Status CreateGList(GList* L, SString S) {
  *��ע��
  * ���ｫ"( )"����Ϊ�����Ϊ�յ�״̬��
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L, Head);
     printf("\n");
 }
diff --git a/Dev-C++/ExerciseBook/05.35-05.36/GList.h b/Dev-C++/ExerciseBook/05.35-05.36/GList.h
index c9837e7..1a19e26 100644
--- a/Dev-C++/ExerciseBook/05.35-05.36/GList.h
+++ b/Dev-C++/ExerciseBook/05.35-05.36/GList.h
@@ -61,7 +61,7 @@ Status CreateGList(GList* L, SString S);
  *
  * ��������������L��
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * ͼ�λ�������ڲ�ʵ�֣�mark��ͼ�λ������ǡ�
diff --git a/Dev-C++/ExerciseBook/05.37.1/05.37.1.cpp b/Dev-C++/ExerciseBook/05.37.1/05.37.1.cpp
index 11b37d6..cfdcdc9 100644
--- a/Dev-C++/ExerciseBook/05.37.1/05.37.1.cpp
+++ b/Dev-C++/ExerciseBook/05.37.1/05.37.1.cpp
@@ -17,12 +17,12 @@ int main(int argc, char* argv[]) {
     StrAssign(S, s);
     CreateGList(&L, S);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     printf("ɾ�� L �е�Ԫ�� 'b' ...\n");
     Algo_5_37_1(&L, 'b');
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     return 0;
 }
diff --git a/Dev-C++/ExerciseBook/05.37.1/GList-HT.cpp b/Dev-C++/ExerciseBook/05.37.1/GList-HT.cpp
index bad30df..a761587 100644
--- a/Dev-C++/ExerciseBook/05.37.1/GList-HT.cpp
+++ b/Dev-C++/ExerciseBook/05.37.1/GList-HT.cpp
@@ -335,7 +335,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * ��������������L��
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L, Head);
     printf("\n");
 }
diff --git a/Dev-C++/ExerciseBook/05.37.1/GList-HT.h b/Dev-C++/ExerciseBook/05.37.1/GList-HT.h
index 508b96f..bc90362 100644
--- a/Dev-C++/ExerciseBook/05.37.1/GList-HT.h
+++ b/Dev-C++/ExerciseBook/05.37.1/GList-HT.h
@@ -143,7 +143,7 @@ void Traverse(GList L, void (Visit)(AtomType));
  *
  * ��������������L��
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * ͼ�λ�������ڲ�ʵ�֣�mark��ͼ�λ������ǡ�
diff --git a/Dev-C++/ExerciseBook/05.37.2/05.37.2.cpp b/Dev-C++/ExerciseBook/05.37.2/05.37.2.cpp
index 9e5afb1..aa6e2f8 100644
--- a/Dev-C++/ExerciseBook/05.37.2/05.37.2.cpp
+++ b/Dev-C++/ExerciseBook/05.37.2/05.37.2.cpp
@@ -18,12 +18,12 @@ int main(int argc, char* argv[]) {
     StrAssign(S, s);
     CreateGList(&L, S);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     printf("ɾ�� L �е�Ԫ�� 'b' ...\n");
     Algo_5_37_2(&L, 'b');
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     return 0;
 }
diff --git a/Dev-C++/ExerciseBook/05.37.2/GList-E.cpp b/Dev-C++/ExerciseBook/05.37.2/GList-E.cpp
index 3fc0ad9..e5b2ccb 100644
--- a/Dev-C++/ExerciseBook/05.37.2/GList-E.cpp
+++ b/Dev-C++/ExerciseBook/05.37.2/GList-E.cpp
@@ -370,7 +370,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * ��������������L��
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L);
     printf("\n");
 }
diff --git a/Dev-C++/ExerciseBook/05.37.2/GList-E.h b/Dev-C++/ExerciseBook/05.37.2/GList-E.h
index fa9af82..b2b002c 100644
--- a/Dev-C++/ExerciseBook/05.37.2/GList-E.h
+++ b/Dev-C++/ExerciseBook/05.37.2/GList-E.h
@@ -126,7 +126,7 @@ void Traverse(GList L, void(Visit)(AtomType));
  *
  * ��������������L��
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * ͼ�λ�������ڲ�ʵ�֡�
diff --git a/Dev-C++/ExerciseBook/05.38.1/05.38.1.cpp b/Dev-C++/ExerciseBook/05.38.1/05.38.1.cpp
index c41ea76..5c6cd08 100644
--- a/Dev-C++/ExerciseBook/05.38.1/05.38.1.cpp
+++ b/Dev-C++/ExerciseBook/05.38.1/05.38.1.cpp
@@ -17,7 +17,7 @@ int main(int argc, char* argv[]) {
     StrAssign(S, s);
     CreateGList(&L, S);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     printf("������� 2 ���ԭ����Ϊ��");
     Algo_5_38_1(L, 0, 2);
diff --git a/Dev-C++/ExerciseBook/05.38.1/GList-HT.cpp b/Dev-C++/ExerciseBook/05.38.1/GList-HT.cpp
index bad30df..a761587 100644
--- a/Dev-C++/ExerciseBook/05.38.1/GList-HT.cpp
+++ b/Dev-C++/ExerciseBook/05.38.1/GList-HT.cpp
@@ -335,7 +335,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * ��������������L��
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L, Head);
     printf("\n");
 }
diff --git a/Dev-C++/ExerciseBook/05.38.1/GList-HT.h b/Dev-C++/ExerciseBook/05.38.1/GList-HT.h
index 508b96f..bc90362 100644
--- a/Dev-C++/ExerciseBook/05.38.1/GList-HT.h
+++ b/Dev-C++/ExerciseBook/05.38.1/GList-HT.h
@@ -143,7 +143,7 @@ void Traverse(GList L, void (Visit)(AtomType));
  *
  * ��������������L��
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * ͼ�λ�������ڲ�ʵ�֣�mark��ͼ�λ������ǡ�
diff --git a/Dev-C++/ExerciseBook/05.38.2/05.38.2.cpp b/Dev-C++/ExerciseBook/05.38.2/05.38.2.cpp
index ed3096f..1951c1e 100644
--- a/Dev-C++/ExerciseBook/05.38.2/05.38.2.cpp
+++ b/Dev-C++/ExerciseBook/05.38.2/05.38.2.cpp
@@ -17,7 +17,7 @@ int main(int argc, char* argv[]) {
     StrAssign(S, s);
     CreateGList(&L, S);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     printf("������� 2 ���ԭ����Ϊ��");
     Algo_5_38_2(L, 0, 2);
diff --git a/Dev-C++/ExerciseBook/05.38.2/GList-E.cpp b/Dev-C++/ExerciseBook/05.38.2/GList-E.cpp
index 3fc0ad9..e5b2ccb 100644
--- a/Dev-C++/ExerciseBook/05.38.2/GList-E.cpp
+++ b/Dev-C++/ExerciseBook/05.38.2/GList-E.cpp
@@ -370,7 +370,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * ��������������L��
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L);
     printf("\n");
 }
diff --git a/Dev-C++/ExerciseBook/05.38.2/GList-E.h b/Dev-C++/ExerciseBook/05.38.2/GList-E.h
index fa9af82..b2b002c 100644
--- a/Dev-C++/ExerciseBook/05.38.2/GList-E.h
+++ b/Dev-C++/ExerciseBook/05.38.2/GList-E.h
@@ -126,7 +126,7 @@ void Traverse(GList L, void(Visit)(AtomType));
  *
  * ��������������L��
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * ͼ�λ�������ڲ�ʵ�֡�
diff --git a/Dev-C++/ExerciseBook/06.36/06.36.cpp b/Dev-C++/ExerciseBook/06.36/06.36.cpp
index f817b66..29a1fa4 100644
--- a/Dev-C++/ExerciseBook/06.36/06.36.cpp
+++ b/Dev-C++/ExerciseBook/06.36/06.36.cpp
@@ -13,17 +13,17 @@ int main(int argc, char* argv[]) {
     
     printf("���������� B1 ��...\n");
     CreateBiTree(&B1, "TestData_B1.txt");
-    PrintGraph(B1);
+    PrintTree(B1);
     printf("\n");
     
     printf("���������� B2 ��...\n");
     CreateBiTree(&B2, "TestData_B2.txt");
-    PrintGraph(B2);
+    PrintTree(B2);
     printf("\n");
     
     printf("���������� B3 ��...\n");
     CreateBiTree(&B3, "TestData_B3.txt");
-    PrintGraph(B3);
+    PrintTree(B3);
     printf("\n");
     
     if(Algo_6_36(B1, B2) == TRUE) {
diff --git a/Dev-C++/ExerciseBook/06.36/BiTree.cpp b/Dev-C++/ExerciseBook/06.36/BiTree.cpp
index 97a2156..6ac85ce 100644
--- a/Dev-C++/ExerciseBook/06.36/BiTree.cpp
+++ b/Dev-C++/ExerciseBook/06.36/BiTree.cpp
@@ -107,7 +107,7 @@ static void CreateTree(BiTree* T, FILE* fp) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/Dev-C++/ExerciseBook/06.36/BiTree.h b/Dev-C++/ExerciseBook/06.36/BiTree.h
index f4d29c5..a05d724 100644
--- a/Dev-C++/ExerciseBook/06.36/BiTree.h
+++ b/Dev-C++/ExerciseBook/06.36/BiTree.h
@@ -71,6 +71,6 @@ static void CreateTree(BiTree* T, FILE* fp);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/Dev-C++/ExerciseBook/06.36/TestData_B1.txt b/Dev-C++/ExerciseBook/06.36/TestData_B1.txt
index 3171ed9..82cbf99 100644
--- a/Dev-C++/ExerciseBook/06.36/TestData_B1.txt
+++ b/Dev-C++/ExerciseBook/06.36/TestData_B1.txt
@@ -1 +1 @@
-��������ABD^^E^^C^^
\ No newline at end of file
+��������ABD^^E^^C^^
diff --git a/Dev-C++/ExerciseBook/06.36/TestData_B2.txt b/Dev-C++/ExerciseBook/06.36/TestData_B2.txt
index 3c311a7..43f28bc 100644
--- a/Dev-C++/ExerciseBook/06.36/TestData_B2.txt
+++ b/Dev-C++/ExerciseBook/06.36/TestData_B2.txt
@@ -1 +1 @@
-��������FGH^^I^^J^^
\ No newline at end of file
+��������FGH^^I^^J^^
diff --git a/Dev-C++/ExerciseBook/06.36/TestData_B3.txt b/Dev-C++/ExerciseBook/06.36/TestData_B3.txt
index a89ca54..67ebc65 100644
--- a/Dev-C++/ExerciseBook/06.36/TestData_B3.txt
+++ b/Dev-C++/ExerciseBook/06.36/TestData_B3.txt
@@ -1 +1 @@
-��������KLM^^N^^OP^^^
\ No newline at end of file
+��������KLM^^N^^OP^^^
diff --git a/Dev-C++/ExerciseBook/06.37-06.38/06.37-06.38.cpp b/Dev-C++/ExerciseBook/06.37-06.38/06.37-06.38.cpp
index e19a4da..bd04477 100644
--- a/Dev-C++/ExerciseBook/06.37-06.38/06.37-06.38.cpp
+++ b/Dev-C++/ExerciseBook/06.37-06.38/06.37-06.38.cpp
@@ -19,7 +19,7 @@ int main(int argc, char* argv[]) {
     
     printf("���������� T ��...\n");
     CreateBiTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("�������� 6.37 ��֤...������\n");
diff --git a/Dev-C++/ExerciseBook/06.37-06.38/BiTree.cpp b/Dev-C++/ExerciseBook/06.37-06.38/BiTree.cpp
index 97a2156..6ac85ce 100644
--- a/Dev-C++/ExerciseBook/06.37-06.38/BiTree.cpp
+++ b/Dev-C++/ExerciseBook/06.37-06.38/BiTree.cpp
@@ -107,7 +107,7 @@ static void CreateTree(BiTree* T, FILE* fp) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/Dev-C++/ExerciseBook/06.37-06.38/BiTree.h b/Dev-C++/ExerciseBook/06.37-06.38/BiTree.h
index f4d29c5..a05d724 100644
--- a/Dev-C++/ExerciseBook/06.37-06.38/BiTree.h
+++ b/Dev-C++/ExerciseBook/06.37-06.38/BiTree.h
@@ -71,6 +71,6 @@ static void CreateTree(BiTree* T, FILE* fp);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/Dev-C++/ExerciseBook/06.37-06.38/TestData.txt b/Dev-C++/ExerciseBook/06.37-06.38/TestData.txt
index ce10094..98ebe3e 100644
--- a/Dev-C++/ExerciseBook/06.37-06.38/TestData.txt
+++ b/Dev-C++/ExerciseBook/06.37-06.38/TestData.txt
@@ -1 +1 @@
-��������ABDG^^^EH^^I^^CF^J^^^
\ No newline at end of file
+��������ABDG^^^EH^^I^^CF^J^^^
diff --git a/Dev-C++/ExerciseBook/06.41-06.49/06.41-06.49.cpp b/Dev-C++/ExerciseBook/06.41-06.49/06.41-06.49.cpp
index fdb211e..4710d86 100644
--- a/Dev-C++/ExerciseBook/06.41-06.49/06.41-06.49.cpp
+++ b/Dev-C++/ExerciseBook/06.41-06.49/06.41-06.49.cpp
@@ -66,7 +66,7 @@ int main(int argc, char* argv[]) {
     printf("���������� T ...\n");
     InitBiTree(&T);
     CreateBiTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("�������� 6.41 ��֤...������\n");
@@ -94,7 +94,7 @@ int main(int argc, char* argv[]) {
     {
         printf("�����������������������������\n");
         Algo_6_43(T);
-        PrintGraph(T);
+        PrintTree(T);
         printf("\n");
     }
     
@@ -112,7 +112,7 @@ int main(int argc, char* argv[]) {
         
         printf("ɾ������ %c �󣬶�����Ϊ��\n", x);
         if(Algo_6_45(&T, x)) {
-            PrintGraph(T);
+            PrintTree(T);
         }
         printf("\n");
     }
@@ -123,7 +123,7 @@ int main(int argc, char* argv[]) {
         
         printf("���� T �� Tx �󣬶�����TxΪ��\n");
         Algo_6_46(T, &Tx);
-        PrintGraph(Tx);
+        PrintTree(Tx);
         printf("\n");
     }
     
diff --git a/Dev-C++/ExerciseBook/06.41-06.49/BiTree.cpp b/Dev-C++/ExerciseBook/06.41-06.49/BiTree.cpp
index 3491ed2..7ab7f01 100644
--- a/Dev-C++/ExerciseBook/06.41-06.49/BiTree.cpp
+++ b/Dev-C++/ExerciseBook/06.41-06.49/BiTree.cpp
@@ -149,7 +149,7 @@ static void CreateTree(BiTree* T, FILE* fp) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/Dev-C++/ExerciseBook/06.41-06.49/BiTree.h b/Dev-C++/ExerciseBook/06.41-06.49/BiTree.h
index ba89b3e..52fd4a0 100644
--- a/Dev-C++/ExerciseBook/06.41-06.49/BiTree.h
+++ b/Dev-C++/ExerciseBook/06.41-06.49/BiTree.h
@@ -85,6 +85,6 @@ static void CreateTree(BiTree* T, FILE* fp);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/Dev-C++/ExerciseBook/06.41-06.49/TestData.txt b/Dev-C++/ExerciseBook/06.41-06.49/TestData.txt
index ce10094..98ebe3e 100644
--- a/Dev-C++/ExerciseBook/06.41-06.49/TestData.txt
+++ b/Dev-C++/ExerciseBook/06.41-06.49/TestData.txt
@@ -1 +1 @@
-��������ABDG^^^EH^^I^^CF^J^^^
\ No newline at end of file
+��������ABDG^^^EH^^I^^CF^J^^^
diff --git a/Dev-C++/ExerciseBook/06.50/06.50.cpp b/Dev-C++/ExerciseBook/06.50/06.50.cpp
index e4d9899..fd3cb23 100644
--- a/Dev-C++/ExerciseBook/06.50/06.50.cpp
+++ b/Dev-C++/ExerciseBook/06.50/06.50.cpp
@@ -22,7 +22,7 @@ int main(int argc, char* argv[]) {
     printf("\n");
     
     printf("������T��\n");
-    PrintGraph(T);
+    PrintTree(T);
     
     return 0;
 }
diff --git a/Dev-C++/ExerciseBook/06.50/BiTree.cpp b/Dev-C++/ExerciseBook/06.50/BiTree.cpp
index 76327ed..f772f85 100644
--- a/Dev-C++/ExerciseBook/06.50/BiTree.cpp
+++ b/Dev-C++/ExerciseBook/06.50/BiTree.cpp
@@ -50,7 +50,7 @@ int BiTreeDepth(BiTree T) {
 }
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/Dev-C++/ExerciseBook/06.50/BiTree.h b/Dev-C++/ExerciseBook/06.50/BiTree.h
index d53885f..3ab5bf3 100644
--- a/Dev-C++/ExerciseBook/06.50/BiTree.h
+++ b/Dev-C++/ExerciseBook/06.50/BiTree.h
@@ -49,6 +49,6 @@ Status BiTreeEmpty(BiTree T);
 int BiTreeDepth(BiTree T);
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/Dev-C++/ExerciseBook/06.50/TestData.txt b/Dev-C++/ExerciseBook/06.50/TestData.txt
index 43ff76f..66e43bb 100644
--- a/Dev-C++/ExerciseBook/06.50/TestData.txt
+++ b/Dev-C++/ExerciseBook/06.50/TestData.txt
@@ -6,4 +6,4 @@ CEL
 CFR
 DGR
 FHL
-^^L
\ No newline at end of file
+^^L
diff --git a/Dev-C++/ExerciseBook/06.51/06.51.cpp b/Dev-C++/ExerciseBook/06.51/06.51.cpp
index 8dfa052..eb334e8 100644
--- a/Dev-C++/ExerciseBook/06.51/06.51.cpp
+++ b/Dev-C++/ExerciseBook/06.51/06.51.cpp
@@ -20,7 +20,7 @@ int main(int argc, char* argv[]) {
     printf("��������������������T...\n");
     InitBiTree(&T);
     CreateBiTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("�����������ʽ��");
diff --git a/Dev-C++/ExerciseBook/06.51/BiTree.cpp b/Dev-C++/ExerciseBook/06.51/BiTree.cpp
index 3491ed2..7ab7f01 100644
--- a/Dev-C++/ExerciseBook/06.51/BiTree.cpp
+++ b/Dev-C++/ExerciseBook/06.51/BiTree.cpp
@@ -149,7 +149,7 @@ static void CreateTree(BiTree* T, FILE* fp) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/Dev-C++/ExerciseBook/06.51/BiTree.h b/Dev-C++/ExerciseBook/06.51/BiTree.h
index ba89b3e..52fd4a0 100644
--- a/Dev-C++/ExerciseBook/06.51/BiTree.h
+++ b/Dev-C++/ExerciseBook/06.51/BiTree.h
@@ -85,6 +85,6 @@ static void CreateTree(BiTree* T, FILE* fp);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/Dev-C++/ExerciseBook/06.51/TestData.txt b/Dev-C++/ExerciseBook/06.51/TestData.txt
index be56cc6..e53e33a 100644
--- a/Dev-C++/ExerciseBook/06.51/TestData.txt
+++ b/Dev-C++/ExerciseBook/06.51/TestData.txt
@@ -1 +1 @@
-��������*/*+a^^b^^-c^^d^^e^^-g^^h^^
\ No newline at end of file
+��������*/*+a^^b^^-c^^d^^e^^-g^^h^^
diff --git a/Dev-C++/ExerciseBook/06.52/06.52.cpp b/Dev-C++/ExerciseBook/06.52/06.52.cpp
index 49b08f3..6916937 100644
--- a/Dev-C++/ExerciseBook/06.52/06.52.cpp
+++ b/Dev-C++/ExerciseBook/06.52/06.52.cpp
@@ -17,7 +17,7 @@ int main(int argc, char* argv[]) {
     printf("��������������������T...\n");
     InitBiTree(&T);
     CreateBiTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("���ķ�ï��Ϊ�� %d", Algo_6_52(T));
diff --git a/Dev-C++/ExerciseBook/06.52/BiTree.cpp b/Dev-C++/ExerciseBook/06.52/BiTree.cpp
index 3491ed2..7ab7f01 100644
--- a/Dev-C++/ExerciseBook/06.52/BiTree.cpp
+++ b/Dev-C++/ExerciseBook/06.52/BiTree.cpp
@@ -149,7 +149,7 @@ static void CreateTree(BiTree* T, FILE* fp) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/Dev-C++/ExerciseBook/06.52/BiTree.h b/Dev-C++/ExerciseBook/06.52/BiTree.h
index ba89b3e..52fd4a0 100644
--- a/Dev-C++/ExerciseBook/06.52/BiTree.h
+++ b/Dev-C++/ExerciseBook/06.52/BiTree.h
@@ -85,6 +85,6 @@ static void CreateTree(BiTree* T, FILE* fp);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/Dev-C++/ExerciseBook/06.52/TestData.txt b/Dev-C++/ExerciseBook/06.52/TestData.txt
index ce10094..98ebe3e 100644
--- a/Dev-C++/ExerciseBook/06.52/TestData.txt
+++ b/Dev-C++/ExerciseBook/06.52/TestData.txt
@@ -1 +1 @@
-��������ABDG^^^EH^^I^^CF^J^^^
\ No newline at end of file
+��������ABDG^^^EH^^I^^CF^J^^^
diff --git a/Dev-C++/ExerciseBook/06.53/06.53.cpp b/Dev-C++/ExerciseBook/06.53/06.53.cpp
index 0e615b1..00a8238 100644
--- a/Dev-C++/ExerciseBook/06.53/06.53.cpp
+++ b/Dev-C++/ExerciseBook/06.53/06.53.cpp
@@ -18,7 +18,7 @@ int main(int argc, char* argv[]) {
     printf("��������������������T...\n");
     InitBiTree(&T);
     CreateBiTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("�������㵽Ҷ�ӽ���·��������һ����");
diff --git a/Dev-C++/ExerciseBook/06.53/BiTree.cpp b/Dev-C++/ExerciseBook/06.53/BiTree.cpp
index 3491ed2..7ab7f01 100644
--- a/Dev-C++/ExerciseBook/06.53/BiTree.cpp
+++ b/Dev-C++/ExerciseBook/06.53/BiTree.cpp
@@ -149,7 +149,7 @@ static void CreateTree(BiTree* T, FILE* fp) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/Dev-C++/ExerciseBook/06.53/BiTree.h b/Dev-C++/ExerciseBook/06.53/BiTree.h
index ba89b3e..52fd4a0 100644
--- a/Dev-C++/ExerciseBook/06.53/BiTree.h
+++ b/Dev-C++/ExerciseBook/06.53/BiTree.h
@@ -85,6 +85,6 @@ static void CreateTree(BiTree* T, FILE* fp);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/Dev-C++/ExerciseBook/06.53/TestData.txt b/Dev-C++/ExerciseBook/06.53/TestData.txt
index f00a60d..f6cf3b7 100644
--- a/Dev-C++/ExerciseBook/06.53/TestData.txt
+++ b/Dev-C++/ExerciseBook/06.53/TestData.txt
@@ -1 +1 @@
-��������ABD^^EG^^^CF^HI^^J^^^
\ No newline at end of file
+��������ABD^^EG^^^CF^HI^^J^^^
diff --git a/Dev-C++/ExerciseBook/06.54/06.54.cpp b/Dev-C++/ExerciseBook/06.54/06.54.cpp
index 41a7070..250143e 100644
--- a/Dev-C++/ExerciseBook/06.54/06.54.cpp
+++ b/Dev-C++/ExerciseBook/06.54/06.54.cpp
@@ -17,7 +17,7 @@ int main(int argc, char* argv[]) {
    
     printf("��������������������...\n");
     Algo_6_54(&T, sa);
-    PrintGraph(T);
+    PrintTree(T);
     
     return 0;
 }
diff --git a/Dev-C++/ExerciseBook/06.54/BiTree.cpp b/Dev-C++/ExerciseBook/06.54/BiTree.cpp
index 76327ed..f772f85 100644
--- a/Dev-C++/ExerciseBook/06.54/BiTree.cpp
+++ b/Dev-C++/ExerciseBook/06.54/BiTree.cpp
@@ -50,7 +50,7 @@ int BiTreeDepth(BiTree T) {
 }
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/Dev-C++/ExerciseBook/06.54/BiTree.h b/Dev-C++/ExerciseBook/06.54/BiTree.h
index d53885f..3ab5bf3 100644
--- a/Dev-C++/ExerciseBook/06.54/BiTree.h
+++ b/Dev-C++/ExerciseBook/06.54/BiTree.h
@@ -49,6 +49,6 @@ Status BiTreeEmpty(BiTree T);
 int BiTreeDepth(BiTree T);
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/Dev-C++/ExerciseBook/06.55/06.55.cpp b/Dev-C++/ExerciseBook/06.55/06.55.cpp
index 916f194..fa8956e 100644
--- a/Dev-C++/ExerciseBook/06.55/06.55.cpp
+++ b/Dev-C++/ExerciseBook/06.55/06.55.cpp
@@ -18,7 +18,7 @@ int main(int argc, char* argv[]) {
     printf("��������������������T...\n");
     InitBiTree(&T);
     CreateBiTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("����������������ֵ������Ӧ��������Ŀ��\n");
diff --git a/Dev-C++/ExerciseBook/06.55/BiTree.cpp b/Dev-C++/ExerciseBook/06.55/BiTree.cpp
index 3491ed2..7ab7f01 100644
--- a/Dev-C++/ExerciseBook/06.55/BiTree.cpp
+++ b/Dev-C++/ExerciseBook/06.55/BiTree.cpp
@@ -149,7 +149,7 @@ static void CreateTree(BiTree* T, FILE* fp) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/Dev-C++/ExerciseBook/06.55/BiTree.h b/Dev-C++/ExerciseBook/06.55/BiTree.h
index 425dfa1..e3fb736 100644
--- a/Dev-C++/ExerciseBook/06.55/BiTree.h
+++ b/Dev-C++/ExerciseBook/06.55/BiTree.h
@@ -87,6 +87,6 @@ static void CreateTree(BiTree* T, FILE* fp);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/Dev-C++/ExerciseBook/06.55/TestData.txt b/Dev-C++/ExerciseBook/06.55/TestData.txt
index ce10094..98ebe3e 100644
--- a/Dev-C++/ExerciseBook/06.55/TestData.txt
+++ b/Dev-C++/ExerciseBook/06.55/TestData.txt
@@ -1 +1 @@
-��������ABDG^^^EH^^I^^CF^J^^^
\ No newline at end of file
+��������ABDG^^^EH^^I^^CF^J^^^
diff --git a/Dev-C++/ExerciseBook/06.59-06.62/06.59-06.62.cpp b/Dev-C++/ExerciseBook/06.59-06.62/06.59-06.62.cpp
index 994ec7f..c889d1a 100644
--- a/Dev-C++/ExerciseBook/06.59-06.62/06.59-06.62.cpp
+++ b/Dev-C++/ExerciseBook/06.59-06.62/06.59-06.62.cpp
@@ -31,7 +31,7 @@ int main(int argc, char* argv[]) {
     printf("����������������T...\n");
     InitTree(&T);
     CreateTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("�������� 6.59 ��֤...������\n");
diff --git a/Dev-C++/ExerciseBook/06.59-06.62/CSTree.cpp b/Dev-C++/ExerciseBook/06.59-06.62/CSTree.cpp
index 64d258f..387a571 100644
--- a/Dev-C++/ExerciseBook/06.59-06.62/CSTree.cpp
+++ b/Dev-C++/ExerciseBook/06.59-06.62/CSTree.cpp
@@ -128,7 +128,7 @@ static void Depth(CSTree T, int d, int* max) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CSTree T) {
+void PrintTree(CSTree T) {
     
     // ���������������������
     if(TreeEmpty(T)) {
diff --git a/Dev-C++/ExerciseBook/06.59-06.62/CSTree.h b/Dev-C++/ExerciseBook/06.59-06.62/CSTree.h
index 3d95beb..1bd284a 100644
--- a/Dev-C++/ExerciseBook/06.59-06.62/CSTree.h
+++ b/Dev-C++/ExerciseBook/06.59-06.62/CSTree.h
@@ -79,7 +79,7 @@ static void Depth(CSTree T, int d, int *max);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CSTree T);
+void PrintTree(CSTree T);
 
 // ͼ�λ������ǰ�ṹ�ڲ�ʵ��
 static void Print(CSTree T, int row);
diff --git a/Dev-C++/ExerciseBook/06.59-06.62/TestData.txt b/Dev-C++/ExerciseBook/06.59-06.62/TestData.txt
index 0b1431c..5be89f1 100644
--- a/Dev-C++/ExerciseBook/06.59-06.62/TestData.txt
+++ b/Dev-C++/ExerciseBook/06.59-06.62/TestData.txt
@@ -1 +1 @@
-RAD^E^^B^CFG^H^K^^^^^
\ No newline at end of file
+RAD^E^^B^CFG^H^K^^^^^
diff --git a/Dev-C++/ExerciseBook/06.63/06.63.cpp b/Dev-C++/ExerciseBook/06.63/06.63.cpp
index dc1592e..94984d8 100644
--- a/Dev-C++/ExerciseBook/06.63/06.63.cpp
+++ b/Dev-C++/ExerciseBook/06.63/06.63.cpp
@@ -14,7 +14,7 @@ int main(int argc, char* argv[]) {
     printf("������T...\n");
     InitTree(&T);
     CreateTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("����������� %d\n", Algo_6_63(T));
diff --git a/Dev-C++/ExerciseBook/06.63/CTree.cpp b/Dev-C++/ExerciseBook/06.63/CTree.cpp
index d2c194a..4874394 100644
--- a/Dev-C++/ExerciseBook/06.63/CTree.cpp
+++ b/Dev-C++/ExerciseBook/06.63/CTree.cpp
@@ -313,7 +313,7 @@ static void getPos(CTree T, Pos pt[]) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CTree T) {
+void PrintTree(CTree T) {
     Pos pt[MAX_TREE_SIZE];
     
     // ���������������������
diff --git a/Dev-C++/ExerciseBook/06.63/CTree.h b/Dev-C++/ExerciseBook/06.63/CTree.h
index 873504b..2fdd34b 100644
--- a/Dev-C++/ExerciseBook/06.63/CTree.h
+++ b/Dev-C++/ExerciseBook/06.63/CTree.h
@@ -118,7 +118,7 @@ static void getPos(CTree T, Pos pt[]);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CTree T);
+void PrintTree(CTree T);
 
 // ͼ�λ������ǰ�ṹ�ڲ�ʵ��
 static void Print(CTree T, Pos pt[], int i);
diff --git a/Dev-C++/ExerciseBook/06.63/TestData.txt b/Dev-C++/ExerciseBook/06.63/TestData.txt
index 5786a62..ad6fff9 100644
--- a/Dev-C++/ExerciseBook/06.63/TestData.txt
+++ b/Dev-C++/ExerciseBook/06.63/TestData.txt
@@ -9,4 +9,4 @@ E
 F�ĺ��ӽ�㣺GHK
 G�ĺ��ӽ�㣺^
 H�ĺ��ӽ�㣺^
-K�ĺ��ӽ�㣺^
\ No newline at end of file
+K�ĺ��ӽ�㣺^
diff --git a/Dev-C++/ExerciseBook/06.64/06.64.cpp b/Dev-C++/ExerciseBook/06.64/06.64.cpp
index 2af54e0..78db19e 100644
--- a/Dev-C++/ExerciseBook/06.64/06.64.cpp
+++ b/Dev-C++/ExerciseBook/06.64/06.64.cpp
@@ -14,7 +14,7 @@ int main(int argc, char* argv[]) {
     printf("������T...\n");
     InitTree(&T);
     CreateTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("����������� %d\n", Algo_6_64(T));
diff --git a/Dev-C++/ExerciseBook/06.64/PTree.cpp b/Dev-C++/ExerciseBook/06.64/PTree.cpp
index 69fd054..5690658 100644
--- a/Dev-C++/ExerciseBook/06.64/PTree.cpp
+++ b/Dev-C++/ExerciseBook/06.64/PTree.cpp
@@ -274,7 +274,7 @@ static void getPos(PTree T, Pos pt[]) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(PTree T) {
+void PrintTree(PTree T) {
     Pos pt[MAX_TREE_SIZE];
     
     // ���������������������
diff --git a/Dev-C++/ExerciseBook/06.64/PTree.h b/Dev-C++/ExerciseBook/06.64/PTree.h
index c47c6ed..607de6a 100644
--- a/Dev-C++/ExerciseBook/06.64/PTree.h
+++ b/Dev-C++/ExerciseBook/06.64/PTree.h
@@ -106,7 +106,7 @@ static void getPos(PTree T, Pos pt[]);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(PTree T);
+void PrintTree(PTree T);
 
 // ͼ�λ������ǰ�ṹ�ڲ�ʵ��
 static void Print(PTree T, Pos pt[], int i);
diff --git a/Dev-C++/ExerciseBook/06.64/TestData.txt b/Dev-C++/ExerciseBook/06.64/TestData.txt
index 5786a62..ad6fff9 100644
--- a/Dev-C++/ExerciseBook/06.64/TestData.txt
+++ b/Dev-C++/ExerciseBook/06.64/TestData.txt
@@ -9,4 +9,4 @@ E
 F�ĺ��ӽ�㣺GHK
 G�ĺ��ӽ�㣺^
 H�ĺ��ӽ�㣺^
-K�ĺ��ӽ�㣺^
\ No newline at end of file
+K�ĺ��ӽ�㣺^
diff --git a/Dev-C++/ExerciseBook/06.65/06.65.cpp b/Dev-C++/ExerciseBook/06.65/06.65.cpp
index 58c798b..6bd939c 100644
--- a/Dev-C++/ExerciseBook/06.65/06.65.cpp
+++ b/Dev-C++/ExerciseBook/06.65/06.65.cpp
@@ -26,7 +26,7 @@ int main(int argc, char* argv[]) {
     
     printf("�ɴ˹���Ķ�����Ϊ T = \n");
     Algo_6_65(&T);
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     return 0;
diff --git a/Dev-C++/ExerciseBook/06.65/BiTree.cpp b/Dev-C++/ExerciseBook/06.65/BiTree.cpp
index 76327ed..f772f85 100644
--- a/Dev-C++/ExerciseBook/06.65/BiTree.cpp
+++ b/Dev-C++/ExerciseBook/06.65/BiTree.cpp
@@ -50,7 +50,7 @@ int BiTreeDepth(BiTree T) {
 }
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/Dev-C++/ExerciseBook/06.65/BiTree.h b/Dev-C++/ExerciseBook/06.65/BiTree.h
index d53885f..3ab5bf3 100644
--- a/Dev-C++/ExerciseBook/06.65/BiTree.h
+++ b/Dev-C++/ExerciseBook/06.65/BiTree.h
@@ -49,6 +49,6 @@ Status BiTreeEmpty(BiTree T);
 int BiTreeDepth(BiTree T);
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/Dev-C++/ExerciseBook/06.66/06.66.cpp b/Dev-C++/ExerciseBook/06.66/06.66.cpp
index df12be3..94b905d 100644
--- a/Dev-C++/ExerciseBook/06.66/06.66.cpp
+++ b/Dev-C++/ExerciseBook/06.66/06.66.cpp
@@ -17,12 +17,12 @@ int main(int argc, char* argv[]) {
     printf("������T...\n");
     InitTree_P(&PT);
     CreateTree_P(&PT, "TestData.txt");
-    PrintGraph_P(PT);
+    PrintTree_P(PT);
     printf("\n");
     
     printf("����˫�ױ�ʾ��תΪ���ĺ���-�ֵܱ�ʾ����\n");
     CST = Algo_6_66(PT);
-    PrintGraph_CS(CST);
+    PrintTree_CS(CST);
     printf("\n");
     
     return 0;
diff --git a/Dev-C++/ExerciseBook/06.66/CSTree.cpp b/Dev-C++/ExerciseBook/06.66/CSTree.cpp
index a121656..819aa17 100644
--- a/Dev-C++/ExerciseBook/06.66/CSTree.cpp
+++ b/Dev-C++/ExerciseBook/06.66/CSTree.cpp
@@ -29,7 +29,7 @@ Status TreeEmpty_CS(CSTree T) {
 }
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph_CS(CSTree T) {
+void PrintTree_CS(CSTree T) {
     
     // ���������������������
     if(TreeEmpty_CS(T)) {
diff --git a/Dev-C++/ExerciseBook/06.66/CSTree.h b/Dev-C++/ExerciseBook/06.66/CSTree.h
index 2899652..7c80158 100644
--- a/Dev-C++/ExerciseBook/06.66/CSTree.h
+++ b/Dev-C++/ExerciseBook/06.66/CSTree.h
@@ -42,7 +42,7 @@ Status InitTree_CS(CSTree* T);
 Status TreeEmpty_CS(CSTree T);
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph_CS(CSTree T);
+void PrintTree_CS(CSTree T);
 
 // ͼ�λ������ǰ�ṹ�ڲ�ʵ��
 static void Print_CS(CSTree T, int row);
diff --git a/Dev-C++/ExerciseBook/06.66/PTree.cpp b/Dev-C++/ExerciseBook/06.66/PTree.cpp
index 9ea6921..44e80ec 100644
--- a/Dev-C++/ExerciseBook/06.66/PTree.cpp
+++ b/Dev-C++/ExerciseBook/06.66/PTree.cpp
@@ -246,7 +246,7 @@ static void getPos_P(PTree T, Pos pt[]) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph_P(PTree T) {
+void PrintTree_P(PTree T) {
     Pos pt[MAX_TREE_SIZE];
     
     // ���������������������
diff --git a/Dev-C++/ExerciseBook/06.66/PTree.h b/Dev-C++/ExerciseBook/06.66/PTree.h
index 9bf3676..34305c7 100644
--- a/Dev-C++/ExerciseBook/06.66/PTree.h
+++ b/Dev-C++/ExerciseBook/06.66/PTree.h
@@ -99,7 +99,7 @@ static void getPos_P(PTree T, Pos pt[]);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph_P(PTree T);
+void PrintTree_P(PTree T);
 
 // ͼ�λ������ǰ�ṹ�ڲ�ʵ��
 static void Print_P(PTree T, Pos pt[], int i);
diff --git a/Dev-C++/ExerciseBook/06.66/TestData.txt b/Dev-C++/ExerciseBook/06.66/TestData.txt
index 5786a62..ad6fff9 100644
--- a/Dev-C++/ExerciseBook/06.66/TestData.txt
+++ b/Dev-C++/ExerciseBook/06.66/TestData.txt
@@ -9,4 +9,4 @@ E
 F�ĺ��ӽ�㣺GHK
 G�ĺ��ӽ�㣺^
 H�ĺ��ӽ�㣺^
-K�ĺ��ӽ�㣺^
\ No newline at end of file
+K�ĺ��ӽ�㣺^
diff --git a/Dev-C++/ExerciseBook/06.67/06.67.cpp b/Dev-C++/ExerciseBook/06.67/06.67.cpp
index e971e1c..2ebefa2 100644
--- a/Dev-C++/ExerciseBook/06.67/06.67.cpp
+++ b/Dev-C++/ExerciseBook/06.67/06.67.cpp
@@ -21,7 +21,7 @@ int main(int argc, char* argv[]) {
     fclose(fp);
     printf("\n");
     
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     return 0;
diff --git a/Dev-C++/ExerciseBook/06.67/CSTree.cpp b/Dev-C++/ExerciseBook/06.67/CSTree.cpp
index 323fd9b..88c2c59 100644
--- a/Dev-C++/ExerciseBook/06.67/CSTree.cpp
+++ b/Dev-C++/ExerciseBook/06.67/CSTree.cpp
@@ -29,7 +29,7 @@ Status TreeEmpty(CSTree T) {
 }
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CSTree T) {
+void PrintTree(CSTree T) {
     
     // ���������������������
     if(TreeEmpty(T)) {
diff --git a/Dev-C++/ExerciseBook/06.67/CSTree.h b/Dev-C++/ExerciseBook/06.67/CSTree.h
index 8c3b490..95ebcd2 100644
--- a/Dev-C++/ExerciseBook/06.67/CSTree.h
+++ b/Dev-C++/ExerciseBook/06.67/CSTree.h
@@ -42,7 +42,7 @@ Status InitTree(CSTree* T);
 Status TreeEmpty(CSTree T);
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CSTree T);
+void PrintTree(CSTree T);
 
 // ͼ�λ������ǰ�ṹ�ڲ�ʵ��
 static void Print(CSTree T, int row);
diff --git a/Dev-C++/ExerciseBook/06.67/TestData.txt b/Dev-C++/ExerciseBook/06.67/TestData.txt
index 3804274..b27f8b1 100644
--- a/Dev-C++/ExerciseBook/06.67/TestData.txt
+++ b/Dev-C++/ExerciseBook/06.67/TestData.txt
@@ -4,4 +4,4 @@ AC
 AD
 CE
 CF
-^^
\ No newline at end of file
+^^
diff --git a/Dev-C++/ExerciseBook/06.68/06.68.cpp b/Dev-C++/ExerciseBook/06.68/06.68.cpp
index 116a90b..8fbfd1c 100644
--- a/Dev-C++/ExerciseBook/06.68/06.68.cpp
+++ b/Dev-C++/ExerciseBook/06.68/06.68.cpp
@@ -21,7 +21,7 @@ int main(int argc, char* argv[]) {
     fclose(fp);
     printf("\n");
     
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     return 0;
diff --git a/Dev-C++/ExerciseBook/06.68/CSTree.cpp b/Dev-C++/ExerciseBook/06.68/CSTree.cpp
index 323fd9b..88c2c59 100644
--- a/Dev-C++/ExerciseBook/06.68/CSTree.cpp
+++ b/Dev-C++/ExerciseBook/06.68/CSTree.cpp
@@ -29,7 +29,7 @@ Status TreeEmpty(CSTree T) {
 }
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CSTree T) {
+void PrintTree(CSTree T) {
     
     // ���������������������
     if(TreeEmpty(T)) {
diff --git a/Dev-C++/ExerciseBook/06.68/CSTree.h b/Dev-C++/ExerciseBook/06.68/CSTree.h
index 8c3b490..95ebcd2 100644
--- a/Dev-C++/ExerciseBook/06.68/CSTree.h
+++ b/Dev-C++/ExerciseBook/06.68/CSTree.h
@@ -42,7 +42,7 @@ Status InitTree(CSTree* T);
 Status TreeEmpty(CSTree T);
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CSTree T);
+void PrintTree(CSTree T);
 
 // ͼ�λ������ǰ�ṹ�ڲ�ʵ��
 static void Print(CSTree T, int row);
diff --git a/Dev-C++/ExerciseBook/06.68/TestData.txt b/Dev-C++/ExerciseBook/06.68/TestData.txt
index 15fc534..c93b35c 100644
--- a/Dev-C++/ExerciseBook/06.68/TestData.txt
+++ b/Dev-C++/ExerciseBook/06.68/TestData.txt
@@ -7,4 +7,4 @@ E 0
 F 3
 G 0
 H 0
-K 0
\ No newline at end of file
+K 0
diff --git a/Dev-C++/ExerciseBook/06.69/06.69.cpp b/Dev-C++/ExerciseBook/06.69/06.69.cpp
index 856bd29..b240700 100644
--- a/Dev-C++/ExerciseBook/06.69/06.69.cpp
+++ b/Dev-C++/ExerciseBook/06.69/06.69.cpp
@@ -14,7 +14,7 @@ int main(int argc, char* argv[]) {
     printf("��������������������T...\n");
     InitBiTree(&T);
     CreateBiTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("�����������Ұ������ӡ����\n");
diff --git a/Dev-C++/ExerciseBook/06.69/BiTree.cpp b/Dev-C++/ExerciseBook/06.69/BiTree.cpp
index 3491ed2..7ab7f01 100644
--- a/Dev-C++/ExerciseBook/06.69/BiTree.cpp
+++ b/Dev-C++/ExerciseBook/06.69/BiTree.cpp
@@ -149,7 +149,7 @@ static void CreateTree(BiTree* T, FILE* fp) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/Dev-C++/ExerciseBook/06.69/BiTree.h b/Dev-C++/ExerciseBook/06.69/BiTree.h
index 425dfa1..e3fb736 100644
--- a/Dev-C++/ExerciseBook/06.69/BiTree.h
+++ b/Dev-C++/ExerciseBook/06.69/BiTree.h
@@ -87,6 +87,6 @@ static void CreateTree(BiTree* T, FILE* fp);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/Dev-C++/ExerciseBook/06.69/TestData.txt b/Dev-C++/ExerciseBook/06.69/TestData.txt
index de785cc..4b7ea08 100644
--- a/Dev-C++/ExerciseBook/06.69/TestData.txt
+++ b/Dev-C++/ExerciseBook/06.69/TestData.txt
@@ -1 +1 @@
-��������AB^D^^CE^F^^^
\ No newline at end of file
+��������AB^D^^CE^F^^^
diff --git a/Dev-C++/ExerciseBook/06.70/06.70.cpp b/Dev-C++/ExerciseBook/06.70/06.70.cpp
index 8eb0c29..8718dee 100644
--- a/Dev-C++/ExerciseBook/06.70/06.70.cpp
+++ b/Dev-C++/ExerciseBook/06.70/06.70.cpp
@@ -17,7 +17,7 @@ int main(int argc, char* argv[]) {
     fp = fopen("TestData.txt", "r");
     Algo_6_70(&T, fp);
     fclose(fp);
-    PrintGraph(T);
+    PrintTree(T);
     
     return 0;
 }
diff --git a/Dev-C++/ExerciseBook/06.70/BiTree.cpp b/Dev-C++/ExerciseBook/06.70/BiTree.cpp
index 76327ed..f772f85 100644
--- a/Dev-C++/ExerciseBook/06.70/BiTree.cpp
+++ b/Dev-C++/ExerciseBook/06.70/BiTree.cpp
@@ -50,7 +50,7 @@ int BiTreeDepth(BiTree T) {
 }
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/Dev-C++/ExerciseBook/06.70/BiTree.h b/Dev-C++/ExerciseBook/06.70/BiTree.h
index d53885f..3ab5bf3 100644
--- a/Dev-C++/ExerciseBook/06.70/BiTree.h
+++ b/Dev-C++/ExerciseBook/06.70/BiTree.h
@@ -49,6 +49,6 @@ Status BiTreeEmpty(BiTree T);
 int BiTreeDepth(BiTree T);
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/Dev-C++/ExerciseBook/06.70/TestData.txt b/Dev-C++/ExerciseBook/06.70/TestData.txt
index 1c5af96..73e9b74 100644
--- a/Dev-C++/ExerciseBook/06.70/TestData.txt
+++ b/Dev-C++/ExerciseBook/06.70/TestData.txt
@@ -1 +1 @@
-A(B(#,D),C(E(#,F),#))
\ No newline at end of file
+A(B(#,D),C(E(#,F),#))
diff --git a/Dev-C++/ExerciseBook/06.71/06.71.cpp b/Dev-C++/ExerciseBook/06.71/06.71.cpp
index 4ca6545..35581c7 100644
--- a/Dev-C++/ExerciseBook/06.71/06.71.cpp
+++ b/Dev-C++/ExerciseBook/06.71/06.71.cpp
@@ -21,7 +21,7 @@ int main(int argc, char* argv[]) {
     printf("����������������T...\n");
     InitTree(&T);
     CreateTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("���� 1������������������ӡ����\n");
diff --git a/Dev-C++/ExerciseBook/06.71/CSTree.cpp b/Dev-C++/ExerciseBook/06.71/CSTree.cpp
index 64d258f..387a571 100644
--- a/Dev-C++/ExerciseBook/06.71/CSTree.cpp
+++ b/Dev-C++/ExerciseBook/06.71/CSTree.cpp
@@ -128,7 +128,7 @@ static void Depth(CSTree T, int d, int* max) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CSTree T) {
+void PrintTree(CSTree T) {
     
     // ���������������������
     if(TreeEmpty(T)) {
diff --git a/Dev-C++/ExerciseBook/06.71/CSTree.h b/Dev-C++/ExerciseBook/06.71/CSTree.h
index 3d95beb..1bd284a 100644
--- a/Dev-C++/ExerciseBook/06.71/CSTree.h
+++ b/Dev-C++/ExerciseBook/06.71/CSTree.h
@@ -79,7 +79,7 @@ static void Depth(CSTree T, int d, int *max);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CSTree T);
+void PrintTree(CSTree T);
 
 // ͼ�λ������ǰ�ṹ�ڲ�ʵ��
 static void Print(CSTree T, int row);
diff --git a/Dev-C++/ExerciseBook/06.71/TestData.txt b/Dev-C++/ExerciseBook/06.71/TestData.txt
index 24661d5..79b8aac 100644
--- a/Dev-C++/ExerciseBook/06.71/TestData.txt
+++ b/Dev-C++/ExerciseBook/06.71/TestData.txt
@@ -1 +1 @@
-ABE^F^^CG^^D^^^
\ No newline at end of file
+ABE^F^^CG^^D^^^
diff --git a/Dev-C++/ExerciseBook/06.72/06.72.cpp b/Dev-C++/ExerciseBook/06.72/06.72.cpp
index 6933c36..5b54ab2 100644
--- a/Dev-C++/ExerciseBook/06.72/06.72.cpp
+++ b/Dev-C++/ExerciseBook/06.72/06.72.cpp
@@ -21,7 +21,7 @@ int main(int argc, char* argv[]) {
     printf("������T...\n");
     InitTree(&T);
     CreateTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("����������������ӡ����\n");
diff --git a/Dev-C++/ExerciseBook/06.72/CTree.cpp b/Dev-C++/ExerciseBook/06.72/CTree.cpp
index d2c194a..4874394 100644
--- a/Dev-C++/ExerciseBook/06.72/CTree.cpp
+++ b/Dev-C++/ExerciseBook/06.72/CTree.cpp
@@ -313,7 +313,7 @@ static void getPos(CTree T, Pos pt[]) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CTree T) {
+void PrintTree(CTree T) {
     Pos pt[MAX_TREE_SIZE];
     
     // ���������������������
diff --git a/Dev-C++/ExerciseBook/06.72/CTree.h b/Dev-C++/ExerciseBook/06.72/CTree.h
index 873504b..2fdd34b 100644
--- a/Dev-C++/ExerciseBook/06.72/CTree.h
+++ b/Dev-C++/ExerciseBook/06.72/CTree.h
@@ -118,7 +118,7 @@ static void getPos(CTree T, Pos pt[]);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CTree T);
+void PrintTree(CTree T);
 
 // ͼ�λ������ǰ�ṹ�ڲ�ʵ��
 static void Print(CTree T, Pos pt[], int i);
diff --git a/Dev-C++/ExerciseBook/06.72/TestData.txt b/Dev-C++/ExerciseBook/06.72/TestData.txt
index 054a1ad..12ae162 100644
--- a/Dev-C++/ExerciseBook/06.72/TestData.txt
+++ b/Dev-C++/ExerciseBook/06.72/TestData.txt
@@ -6,4 +6,4 @@ C
 D�ĺ��ӽ�㣺^
 E�ĺ��ӽ�㣺^
 F�ĺ��ӽ�㣺^
-G�ĺ��ӽ�㣺^
\ No newline at end of file
+G�ĺ��ӽ�㣺^
diff --git a/Dev-C++/ExerciseBook/06.73-06.74/06.73-06.74.cpp b/Dev-C++/ExerciseBook/06.73-06.74/06.73-06.74.cpp
index 49f6c9d..02204fc 100644
--- a/Dev-C++/ExerciseBook/06.73-06.74/06.73-06.74.cpp
+++ b/Dev-C++/ExerciseBook/06.73-06.74/06.73-06.74.cpp
@@ -23,7 +23,7 @@ int main(int argc, char* argv[]) {
     fp = fopen("TestData.txt", "r");
     Algo_6_73(&T, fp);
     fclose(fp);
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("������ �� 6.74 ��֤... ������\n");
diff --git a/Dev-C++/ExerciseBook/06.73-06.74/CSTree.cpp b/Dev-C++/ExerciseBook/06.73-06.74/CSTree.cpp
index 323fd9b..88c2c59 100644
--- a/Dev-C++/ExerciseBook/06.73-06.74/CSTree.cpp
+++ b/Dev-C++/ExerciseBook/06.73-06.74/CSTree.cpp
@@ -29,7 +29,7 @@ Status TreeEmpty(CSTree T) {
 }
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CSTree T) {
+void PrintTree(CSTree T) {
     
     // ���������������������
     if(TreeEmpty(T)) {
diff --git a/Dev-C++/ExerciseBook/06.73-06.74/CSTree.h b/Dev-C++/ExerciseBook/06.73-06.74/CSTree.h
index 8c3b490..95ebcd2 100644
--- a/Dev-C++/ExerciseBook/06.73-06.74/CSTree.h
+++ b/Dev-C++/ExerciseBook/06.73-06.74/CSTree.h
@@ -42,7 +42,7 @@ Status InitTree(CSTree* T);
 Status TreeEmpty(CSTree T);
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CSTree T);
+void PrintTree(CSTree T);
 
 // ͼ�λ������ǰ�ṹ�ڲ�ʵ��
 static void Print(CSTree T, int row);
diff --git a/Dev-C++/ExerciseBook/06.73-06.74/TestData.txt b/Dev-C++/ExerciseBook/06.73-06.74/TestData.txt
index 6502a45..b212d26 100644
--- a/Dev-C++/ExerciseBook/06.73-06.74/TestData.txt
+++ b/Dev-C++/ExerciseBook/06.73-06.74/TestData.txt
@@ -1 +1 @@
-A(B(E,F),C(G),D)
\ No newline at end of file
+A(B(E,F),C(G),D)
diff --git a/Dev-C++/ExerciseBook/06.75-06.76/06.75-06.76.cpp b/Dev-C++/ExerciseBook/06.75-06.76/06.75-06.76.cpp
index a67f7f2..48f539b 100644
--- a/Dev-C++/ExerciseBook/06.75-06.76/06.75-06.76.cpp
+++ b/Dev-C++/ExerciseBook/06.75-06.76/06.75-06.76.cpp
@@ -26,7 +26,7 @@ int main(int argc, char* argv[]) {
     fp = fopen("TestData.txt", "r");
     Algo_6_75(&T, fp);
     fclose(fp);
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("�� 6.76 ��֤...\n");
diff --git a/Dev-C++/ExerciseBook/06.75-06.76/CTree.cpp b/Dev-C++/ExerciseBook/06.75-06.76/CTree.cpp
index ba0d57d..c69501d 100644
--- a/Dev-C++/ExerciseBook/06.75-06.76/CTree.cpp
+++ b/Dev-C++/ExerciseBook/06.75-06.76/CTree.cpp
@@ -131,7 +131,7 @@ static void getPos(CTree T, Pos pt[]) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CTree T) {
+void PrintTree(CTree T) {
     Pos pt[MAX_TREE_SIZE];
     
     // ���������������������
diff --git a/Dev-C++/ExerciseBook/06.75-06.76/CTree.h b/Dev-C++/ExerciseBook/06.75-06.76/CTree.h
index 2647e1b..11f68b7 100644
--- a/Dev-C++/ExerciseBook/06.75-06.76/CTree.h
+++ b/Dev-C++/ExerciseBook/06.75-06.76/CTree.h
@@ -97,7 +97,7 @@ static void getPos(CTree T, Pos pt[]);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CTree T);
+void PrintTree(CTree T);
 
 // ͼ�λ������ǰ�ṹ�ڲ�ʵ��
 static void Print(CTree T, Pos pt[], int i);
diff --git a/Dev-C++/ExerciseBook/06.75-06.76/TestData.txt b/Dev-C++/ExerciseBook/06.75-06.76/TestData.txt
index 6502a45..b212d26 100644
--- a/Dev-C++/ExerciseBook/06.75-06.76/TestData.txt
+++ b/Dev-C++/ExerciseBook/06.75-06.76/TestData.txt
@@ -1 +1 @@
-A(B(E,F),C(G),D)
\ No newline at end of file
+A(B(E,F),C(G),D)
diff --git a/Dev-C++/Status/Status.a b/Dev-C++/Status/Status.a
index 10fb643..ca8c6eb 100644
Binary files a/Dev-C++/Status/Status.a and b/Dev-C++/Status/Status.a differ
diff --git a/Dev-C++/Status/Status.cpp b/Dev-C++/Status/Status.cpp
index 6e7dd50..9e0c0ba 100644
--- a/Dev-C++/Status/Status.cpp
+++ b/Dev-C++/Status/Status.cpp
@@ -163,3 +163,19 @@ void Wait(long time) {
     }
 }
 
+// ��������˵��зָ������'\r'��'\n'��'\r\n'
+void skipLineSeparator(FILE* fp) {
+    int ch;
+
+    if(fp == NULL) {
+        return;
+    }
+
+    while((ch = getc(fp)) != EOF) {
+        if(ch >= 0 && ch <= 127 && ch != '\r' && ch != '\n') {
+            ungetc(ch, fp);
+            break;
+        }
+    }
+}
+
diff --git a/Dev-C++/Status/Status.h b/Dev-C++/Status/Status.h
index 205b695..82c912f 100644
--- a/Dev-C++/Status/Status.h
+++ b/Dev-C++/Status/Status.h
@@ -30,6 +30,9 @@
 /* ״̬������ */
 typedef int Status;
 
+/* �������� */
+typedef int Boolean;
+
 
 // ��ȡ����
 int ReadData(FILE* fp, char* format, ...);
@@ -40,6 +43,9 @@ void PressEnterToContinue();
 // ������ͣһ��ʱ�䣬time�����������ʱ��
 void Wait(long time);
 
+// ��������˵��зָ������'\r'��'\n'��'\r\n'
+void skipLineSeparator(FILE* fp);
+
 #endif
 
 
diff --git a/VisualC++/CourseBook/0206_SLinkList/SLinkList.c b/VisualC++/CourseBook/0206_SLinkList/SLinkList.c
index 8884b59..4e7d466 100644
--- a/VisualC++/CourseBook/0206_SLinkList/SLinkList.c
+++ b/VisualC++/CourseBook/0206_SLinkList/SLinkList.c
@@ -451,7 +451,7 @@ void ListTraverse(SLinkList space, int S, void(Visit)(ElemType)) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(SLinkList space, int S) {
+void PrintList(SLinkList space, int S) {
     int i = 0;
     
     printf("==== ���ÿռ� ====\n");
diff --git a/VisualC++/CourseBook/0206_SLinkList/SLinkList.h b/VisualC++/CourseBook/0206_SLinkList/SLinkList.h
index c511f6c..e5048b5 100644
--- a/VisualC++/CourseBook/0206_SLinkList/SLinkList.h
+++ b/VisualC++/CourseBook/0206_SLinkList/SLinkList.h
@@ -203,6 +203,6 @@ void ListTraverse(SLinkList space, int S, void(Visit)(ElemType));
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(SLinkList space, int S);
+void PrintList(SLinkList space, int S);
 
 #endif
diff --git a/VisualC++/CourseBook/0207_Difference/SLinkList.c b/VisualC++/CourseBook/0207_Difference/SLinkList.c
index 624e0ea..ee2980f 100644
--- a/VisualC++/CourseBook/0207_Difference/SLinkList.c
+++ b/VisualC++/CourseBook/0207_Difference/SLinkList.c
@@ -98,7 +98,7 @@ void ListTraverse(SLinkList space, int S, void(Visit)(ElemType)) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(SLinkList space, int S) {
+void PrintList(SLinkList space, int S) {
     int i = 0;
     
     printf("==== ���ÿռ� ====\n");
diff --git a/VisualC++/CourseBook/0207_Difference/SLinkList.h b/VisualC++/CourseBook/0207_Difference/SLinkList.h
index d92bdf6..ea30c65 100644
--- a/VisualC++/CourseBook/0207_Difference/SLinkList.h
+++ b/VisualC++/CourseBook/0207_Difference/SLinkList.h
@@ -84,6 +84,6 @@ void ListTraverse(SLinkList space, int S, void(Visit)(ElemType));
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(SLinkList space, int S);
+void PrintList(SLinkList space, int S);
 
 #endif
diff --git a/VisualC++/CourseBook/0210_MergeEList/MergeEList.c b/VisualC++/CourseBook/0210_MergeEList/MergeEList.c
index e445d32..55b8703 100644
--- a/VisualC++/CourseBook/0210_MergeEList/MergeEList.c
+++ b/VisualC++/CourseBook/0210_MergeEList/MergeEList.c
@@ -72,4 +72,4 @@ Status MergeEList(ELinkList* La, ELinkList* Lb, ELinkList* Lc, int(Compare)(Elem
     Lb->len = 0;
     
     return OK;
-}
\ No newline at end of file
+}
diff --git a/VisualC++/CourseBook/0210_MergeEList/MergeEList.h b/VisualC++/CourseBook/0210_MergeEList/MergeEList.h
index 5137f17..04e8859 100644
--- a/VisualC++/CourseBook/0210_MergeEList/MergeEList.h
+++ b/VisualC++/CourseBook/0210_MergeEList/MergeEList.h
@@ -27,10 +27,4 @@
  */
 Status MergeEList(ELinkList* La, ELinkList* Lb, ELinkList* Lc, int(Compare)(ElemType, ElemType));
 
-/*������������������������������������������������������������������������
-��(01)�㷨2.21��La��Lb���ǵݼ����У�����鲢Ϊһ���ǵݼ����еĵ�����Lc����
-������������������������������������������������������������������������*/
-
-
-
 #endif
diff --git a/VisualC++/CourseBook/0505_GList-HT/GList-HT-main.c b/VisualC++/CourseBook/0505_GList-HT/GList-HT-main.c
index 6d1fef3..e92b72c 100644
--- a/VisualC++/CourseBook/0505_GList-HT/GList-HT-main.c
+++ b/VisualC++/CourseBook/0505_GList-HT/GList-HT-main.c
@@ -61,10 +61,10 @@ int main(int argc, char** argv) {
     }
     PressEnterToContinue();
     
-    printf("���������������� ���� PrintGraph \n");
+    printf("���������������� ���� PrintGList \n");
     {
         printf("�� �������������� Tmp = ");
-        PrintGraph(Tmp);
+        PrintGList(Tmp);
     }
     PressEnterToContinue();
     
@@ -72,7 +72,7 @@ int main(int argc, char** argv) {
     {
         printf("�� ���� Tmp �� G = ");
         CopyGList(&G, Tmp);
-        PrintGraph(G);
+        PrintGList(G);
     }
     PressEnterToContinue();
     
@@ -83,10 +83,10 @@ int main(int argc, char** argv) {
         printf("�� ɾ������� Tmp �ı�ͷ��");
         
         DeleteFirst(&Tmp, &h);
-        PrintGraph(h);
+        PrintGList(h);
         
         printf("�� Tmp = ");
-        PrintGraph(Tmp);
+        PrintGList(Tmp);
     }
     PressEnterToContinue();
     
@@ -108,7 +108,7 @@ int main(int argc, char** argv) {
         
         printf("�� ����� G �ı�ͷ H = ");
         H = GetHead(G);
-        PrintGraph(H);
+        PrintGList(H);
     }
     PressEnterToContinue();
     
@@ -118,7 +118,7 @@ int main(int argc, char** argv) {
         
         printf("�� ����� G �ı�β T = ");
         T = GetTail(G);
-        PrintGraph(T);
+        PrintGList(T);
     }
     PressEnterToContinue();
     
diff --git a/VisualC++/CourseBook/0505_GList-HT/GList-HT.c b/VisualC++/CourseBook/0505_GList-HT/GList-HT.c
index bad30df..a761587 100644
--- a/VisualC++/CourseBook/0505_GList-HT/GList-HT.c
+++ b/VisualC++/CourseBook/0505_GList-HT/GList-HT.c
@@ -335,7 +335,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * ��������������L��
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L, Head);
     printf("\n");
 }
diff --git a/VisualC++/CourseBook/0505_GList-HT/GList-HT.h b/VisualC++/CourseBook/0505_GList-HT/GList-HT.h
index 508b96f..bc90362 100644
--- a/VisualC++/CourseBook/0505_GList-HT/GList-HT.h
+++ b/VisualC++/CourseBook/0505_GList-HT/GList-HT.h
@@ -143,7 +143,7 @@ void Traverse(GList L, void (Visit)(AtomType));
  *
  * ��������������L��
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * ͼ�λ�������ڲ�ʵ�֣�mark��ͼ�λ������ǡ�
diff --git a/VisualC++/CourseBook/0506_GList-E/GList-E-main.c b/VisualC++/CourseBook/0506_GList-E/GList-E-main.c
index c928a01..b33b5e8 100644
--- a/VisualC++/CourseBook/0506_GList-E/GList-E-main.c
+++ b/VisualC++/CourseBook/0506_GList-E/GList-E-main.c
@@ -61,10 +61,10 @@ int main(int argc, char** argv) {
     }
     PressEnterToContinue();
     
-    printf("���������������� ���� PrintGraph \n");
+    printf("���������������� ���� PrintGList \n");
     {
         printf("�� �������������� Tmp = ");
-        PrintGraph(Tmp);
+        PrintGList(Tmp);
     }
     PressEnterToContinue();
     
@@ -72,7 +72,7 @@ int main(int argc, char** argv) {
     {
         printf("�� ���� Tmp �� G = ");
         CopyGList(&G, Tmp);
-        PrintGraph(G);
+        PrintGList(G);
     }
     PressEnterToContinue();
     
@@ -83,10 +83,10 @@ int main(int argc, char** argv) {
         printf("�� ɾ������� Tmp �ı�ͷ��");
         DeleteFirst(&Tmp, &h);
         
-        PrintGraph(h);
+        PrintGList(h);
         
         printf("�� Tmp = ");
-        PrintGraph(Tmp);
+        PrintGList(Tmp);
     }
     PressEnterToContinue();
     
@@ -108,7 +108,7 @@ int main(int argc, char** argv) {
         
         printf("�� ��ȡ����� G �ı�ͷ H = ");
         H = GetHead(G);
-        PrintGraph(H);
+        PrintGList(H);
     }
     PressEnterToContinue();
     
@@ -118,7 +118,7 @@ int main(int argc, char** argv) {
         
         printf("�� ��ȡ����� G �ı�β T = ");
         T = GetTail(G);
-        PrintGraph(T);
+        PrintGList(T);
     }
     PressEnterToContinue();
     
diff --git a/VisualC++/CourseBook/0506_GList-E/GList-E.c b/VisualC++/CourseBook/0506_GList-E/GList-E.c
index 3fc0ad9..e5b2ccb 100644
--- a/VisualC++/CourseBook/0506_GList-E/GList-E.c
+++ b/VisualC++/CourseBook/0506_GList-E/GList-E.c
@@ -370,7 +370,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * ��������������L��
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L);
     printf("\n");
 }
diff --git a/VisualC++/CourseBook/0506_GList-E/GList-E.h b/VisualC++/CourseBook/0506_GList-E/GList-E.h
index fa9af82..b2b002c 100644
--- a/VisualC++/CourseBook/0506_GList-E/GList-E.h
+++ b/VisualC++/CourseBook/0506_GList-E/GList-E.h
@@ -126,7 +126,7 @@ void Traverse(GList L, void(Visit)(AtomType));
  *
  * ��������������L��
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * ͼ�λ�������ڲ�ʵ�֡�
diff --git a/VisualC++/CourseBook/0507_MPList/MPList-main.c b/VisualC++/CourseBook/0507_MPList/MPList-main.c
index 6b155e3..638c3f7 100644
--- a/VisualC++/CourseBook/0507_MPList/MPList-main.c
+++ b/VisualC++/CourseBook/0507_MPList/MPList-main.c
@@ -7,5 +7,5 @@ int main(int argc, char** argv) {
     
     printf("������Ԫ����ʽ...\n");
     CreateMPList(&P, s, "zxy");
-    PrintGraph(P);
+    PrintMPList(P);
 }
diff --git a/VisualC++/CourseBook/0507_MPList/MPList.c b/VisualC++/CourseBook/0507_MPList/MPList.c
index bb4736d..06e2299 100644
--- a/VisualC++/CourseBook/0507_MPList/MPList.c
+++ b/VisualC++/CourseBook/0507_MPList/MPList.c
@@ -111,7 +111,7 @@ static Status Create(MPList* P, char* S) {
  *
  * ���������mԪ����P��
  */
-void PrintGraph(MPList P) {
+void PrintMPList(MPList P) {
     if(P == NULL) {
         printf("\n");
         return;
diff --git a/VisualC++/CourseBook/0507_MPList/MPList.h b/VisualC++/CourseBook/0507_MPList/MPList.h
index f372e3a..f10682f 100644
--- a/VisualC++/CourseBook/0507_MPList/MPList.h
+++ b/VisualC++/CourseBook/0507_MPList/MPList.h
@@ -72,7 +72,7 @@ static Status Create(MPList* P, char* S);
  *
  * ���������mԪ����P��
  */
-void PrintGraph(MPList P);
+void PrintMPList(MPList P);
 
 /*
  * ͼ�λ�������ڲ�ʵ��
diff --git a/VisualC++/CourseBook/0601_SqBiTree/SqBiTree-main.c b/VisualC++/CourseBook/0601_SqBiTree/SqBiTree-main.c
index 4505253..2227b81 100644
--- a/VisualC++/CourseBook/0601_SqBiTree/SqBiTree-main.c
+++ b/VisualC++/CourseBook/0601_SqBiTree/SqBiTree-main.c
@@ -35,10 +35,10 @@ int main(int argc, char* argv[]) {
     PressEnterToContinue();
     
     
-    printf("���������������� PrintGraph \n");
+    printf("���������������� PrintTree \n");
     {
         printf("�� ���������Ľṹ��ӡ�� T ...\n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -89,7 +89,7 @@ int main(int argc, char* argv[]) {
         TElemType value = 'X';
         printf("�� ����� %c ��ֵΪ %c ��T = \n", e, value);
         Assign(T, e, value);
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -142,20 +142,20 @@ int main(int argc, char* argv[]) {
         printf("�� �������� c1 ...\n");
         InitBiTree(c1);
         CreateBiTree(c1, "TestData_c1.txt");
-        PrintGraph(c1);
+        PrintTree(c1);
     
         printf("�� �������� c2 ...\n");
         InitBiTree(c2);
         CreateBiTree(c2, "TestData_c2.txt");
-        PrintGraph(c2);
+        PrintTree(c2);
     
         printf("�� ������ c1 ���������� T �� %c ���������� ...\n", p1);
         InsertChild(T, p1, 1, c1);
-        PrintGraph(T);
+        PrintTree(T);
     
         printf("�� ������ c2 ���������� T �� %c ���������� ...\n", p2);
         InsertChild(T, p2, 0, c2);
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -167,11 +167,11 @@ int main(int argc, char* argv[]) {
     
         printf("�� ɾ�������� T �� %c ���������� ...\n", p1);
         DeleteChild(T, p1, 1);
-        PrintGraph(T);
+        PrintTree(T);
     
         printf("�� ɾ�������� T �� %c ���������� ...\n", p2);
         DeleteChild(T, p2, 0);
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
diff --git a/VisualC++/CourseBook/0601_SqBiTree/SqBiTree.c b/VisualC++/CourseBook/0601_SqBiTree/SqBiTree.c
index b2b8a58..0173ae9 100644
--- a/VisualC++/CourseBook/0601_SqBiTree/SqBiTree.c
+++ b/VisualC++/CourseBook/0601_SqBiTree/SqBiTree.c
@@ -628,7 +628,7 @@ static Status PostTraverse(SqBiTree T, Status(Visit)(TElemType), int i) {
 
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
-void PrintGraph(SqBiTree T) {
+void PrintTree(SqBiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/VisualC++/CourseBook/0601_SqBiTree/SqBiTree.h b/VisualC++/CourseBook/0601_SqBiTree/SqBiTree.h
index 5f0b5da..c1bfd6f 100644
--- a/VisualC++/CourseBook/0601_SqBiTree/SqBiTree.h
+++ b/VisualC++/CourseBook/0601_SqBiTree/SqBiTree.h
@@ -205,6 +205,6 @@ static Status PostTraverse(SqBiTree T, Status(Visit)(TElemType), int i);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(SqBiTree T);
+void PrintTree(SqBiTree T);
 
 #endif
diff --git a/VisualC++/CourseBook/0602_BiTree/BiTree-main.c b/VisualC++/CourseBook/0602_BiTree/BiTree-main.c
index 2224131..a4365ff 100644
--- a/VisualC++/CourseBook/0602_BiTree/BiTree-main.c
+++ b/VisualC++/CourseBook/0602_BiTree/BiTree-main.c
@@ -35,10 +35,10 @@ int main(int argc, char* argv[]) {
     PressEnterToContinue();
     
     
-    printf("���������������� PrintGraph \n");
+    printf("���������������� PrintTree \n");
     {
         printf("�� ���������Ľṹ��ӡ�� T ...\n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -89,7 +89,7 @@ int main(int argc, char* argv[]) {
         TElemType value = 'X';
         printf("�� ����� %c ��ֵΪ %c ��T = \n", e, value);
         Assign(T, e, value);
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -142,20 +142,20 @@ int main(int argc, char* argv[]) {
         printf("�� �������� c1 ...\n");
         InitBiTree(&c1);
         CreateBiTree(&c1, "TestData_c1.txt");
-        PrintGraph(c1);
+        PrintTree(c1);
         
         printf("�� �������� c2 ...\n");
         InitBiTree(&c2);
         CreateBiTree(&c2, "TestData_c2.txt");
-        PrintGraph(c2);
+        PrintTree(c2);
         
         printf("�� ������ c1 ���������� T �� %c ���������� ...\n", p1);
         InsertChild(T, p1, 1, c1);
-        PrintGraph(T);
+        PrintTree(T);
         
         printf("�� ������ c2 ���������� T �� %c ���������� ...\n", p2);
         InsertChild(T, p2, 0, c2);
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -167,11 +167,11 @@ int main(int argc, char* argv[]) {
         
         printf("�� ɾ�������� T �� %c ���������� ...\n", p1);
         DeleteChild(T, p1, 1);
-        PrintGraph(T);
+        PrintTree(T);
         
         printf("�� ɾ�������� T �� %c ���������� ...\n", p2);
         DeleteChild(T, p2, 0);
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
diff --git a/VisualC++/CourseBook/0602_BiTree/BiTree.c b/VisualC++/CourseBook/0602_BiTree/BiTree.c
index 116e5da..884761b 100644
--- a/VisualC++/CourseBook/0602_BiTree/BiTree.c
+++ b/VisualC++/CourseBook/0602_BiTree/BiTree.c
@@ -700,7 +700,7 @@ static Status PostTraverse(BiTree T, Status(Visit)(TElemType)) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/VisualC++/CourseBook/0602_BiTree/BiTree.h b/VisualC++/CourseBook/0602_BiTree/BiTree.h
index 0d85e87..61ea492 100644
--- a/VisualC++/CourseBook/0602_BiTree/BiTree.h
+++ b/VisualC++/CourseBook/0602_BiTree/BiTree.h
@@ -225,6 +225,6 @@ static Status PostTraverse(BiTree T, Status(Visit)(TElemType));
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/VisualC++/CourseBook/0603_BiTriTree/BiTriTree-main.c b/VisualC++/CourseBook/0603_BiTriTree/BiTriTree-main.c
index 519c50f..3533f67 100644
--- a/VisualC++/CourseBook/0603_BiTriTree/BiTriTree-main.c
+++ b/VisualC++/CourseBook/0603_BiTriTree/BiTriTree-main.c
@@ -34,10 +34,10 @@ int main(int argc, char* argv[]) {
     PressEnterToContinue();
     
     
-    printf("���������������� PrintGraph \n");
+    printf("���������������� PrintTree \n");
     {
         printf("�� ���������Ľṹ��ӡ�� T ...\n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -88,7 +88,7 @@ int main(int argc, char* argv[]) {
         TElemType value = 'X';
         printf("�� ����� %c ��ֵΪ %c ��T = \n", e, value);
         Assign(T, e, value);
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -141,20 +141,20 @@ int main(int argc, char* argv[]) {
         printf("�� �������� c1 ...\n");
         InitBiTree(&c1);
         CreateBiTree(&c1, "TestData_c1.txt");
-        PrintGraph(c1);
+        PrintTree(c1);
         
         printf("�� �������� c2 ...\n");
         InitBiTree(&c2);
         CreateBiTree(&c2, "TestData_c2.txt");
-        PrintGraph(c2);
+        PrintTree(c2);
         
         printf("�� ������ c1 ���������� T �� %c ���������� ...\n", p1);
         InsertChild(T, p1, 1, c1);
-        PrintGraph(T);
+        PrintTree(T);
         
         printf("�� ������ c2 ���������� T �� %c ���������� ...\n", p2);
         InsertChild(T, p2, 0, c2);
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -166,11 +166,11 @@ int main(int argc, char* argv[]) {
         
         printf("�� ɾ�������� T �� %c ���������� ...\n", p1);
         DeleteChild(T, p1, 1);
-        PrintGraph(T);
+        PrintTree(T);
         
         printf("�� ɾ�������� T �� %c ���������� ...\n", p2);
         DeleteChild(T, p2, 0);
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
diff --git a/VisualC++/CourseBook/0603_BiTriTree/BiTriTree.c b/VisualC++/CourseBook/0603_BiTriTree/BiTriTree.c
index 500d5ff..c65a2f2 100644
--- a/VisualC++/CourseBook/0603_BiTriTree/BiTriTree.c
+++ b/VisualC++/CourseBook/0603_BiTriTree/BiTriTree.c
@@ -602,7 +602,7 @@ static Status PostTraverse(BiTriTree T, Status(Visit)(TElemType)) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTriTree T) {
+void PrintTree(BiTriTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/VisualC++/CourseBook/0603_BiTriTree/BiTriTree.h b/VisualC++/CourseBook/0603_BiTriTree/BiTriTree.h
index 07de558..7668a7e 100644
--- a/VisualC++/CourseBook/0603_BiTriTree/BiTriTree.h
+++ b/VisualC++/CourseBook/0603_BiTriTree/BiTriTree.h
@@ -201,6 +201,6 @@ static Status PostTraverse(BiTriTree T, Status(Visit)(TElemType));
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTriTree T);
+void PrintTree(BiTriTree T);
 
 #endif
diff --git a/VisualC++/CourseBook/0605_PTree/PTree-main.c b/VisualC++/CourseBook/0605_PTree/PTree-main.c
index 024e24b..aeeefad 100644
--- a/VisualC++/CourseBook/0605_PTree/PTree-main.c
+++ b/VisualC++/CourseBook/0605_PTree/PTree-main.c
@@ -35,11 +35,11 @@ int main(int argc, char* argv[]) {
     PressEnterToContinue();
     
     
-    printf("���������������� PrintGraph \n");
+    printf("���������������� PrintTree \n");
     {
         printf("�� �����Ľṹ��ӡ�� T ...\n");
         printf("�� T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -83,7 +83,7 @@ int main(int argc, char* argv[]) {
         printf("�� ����� %c ��ֵΪ %c ...\n", e, value);
         Assign(&T, e, value);
         printf("�� T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -146,12 +146,12 @@ int main(int argc, char* argv[]) {
         InitTree(&c);
         CreateTree(&c, "TestData_c.txt");
         printf("�� c = \n");
-        PrintGraph(c);
+        PrintTree(c);
         
         printf("�� ������ c ����Ϊ�� T �� %c ���ĵ� %d ������ ...\n", p, i);
         InsertChild(&T, p, i, c);
         printf("�� T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -164,7 +164,7 @@ int main(int argc, char* argv[]) {
         printf("�� ɾ���� T �� %c ���ĵ� %d ������ ...\n", p, i);
         DeleteChild(&T, p, i);
         printf("�� T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
diff --git a/VisualC++/CourseBook/0605_PTree/PTree.c b/VisualC++/CourseBook/0605_PTree/PTree.c
index 4794b39..ee1e32d 100644
--- a/VisualC++/CourseBook/0605_PTree/PTree.c
+++ b/VisualC++/CourseBook/0605_PTree/PTree.c
@@ -1068,7 +1068,7 @@ static void printPos(PTree T, Pos pt[]) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(PTree T) {
+void PrintTree(PTree T) {
     Pos pt[MAX_TREE_SIZE];
     
     // ���������������������
diff --git a/VisualC++/CourseBook/0605_PTree/PTree.h b/VisualC++/CourseBook/0605_PTree/PTree.h
index 57c2666..2636b3e 100644
--- a/VisualC++/CourseBook/0605_PTree/PTree.h
+++ b/VisualC++/CourseBook/0605_PTree/PTree.h
@@ -231,7 +231,7 @@ static void printPos(PTree T, Pos pt[]);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(PTree T);
+void PrintTree(PTree T);
 
 // ͼ�λ������ǰ�ṹ�ڲ�ʵ��
 static void Print(PTree T, Pos pt[], int i);
diff --git a/VisualC++/CourseBook/0606_CTree/CTree-main.c b/VisualC++/CourseBook/0606_CTree/CTree-main.c
index 57317a1..047ad9a 100644
--- a/VisualC++/CourseBook/0606_CTree/CTree-main.c
+++ b/VisualC++/CourseBook/0606_CTree/CTree-main.c
@@ -35,11 +35,11 @@ int main(int argc, char* argv[]) {
     PressEnterToContinue();
     
     
-    printf("���������������� PrintGraph \n");
+    printf("���������������� PrintTree \n");
     {
         printf("�� �����Ľṹ��ӡ�� T ...\n");
         printf("�� T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -83,7 +83,7 @@ int main(int argc, char* argv[]) {
         printf("�� ����� %c ��ֵΪ %c ...\n", e, value);
         Assign(&T, e, value);
         printf("�� T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -146,12 +146,12 @@ int main(int argc, char* argv[]) {
         InitTree(&c);
         CreateTree(&c, "TestData_c.txt");
         printf("�� c = \n");
-        PrintGraph(c);
+        PrintTree(c);
         
         printf("�� ������ c ����Ϊ�� T �� %c ���ĵ� %d ������ ...\n", p, i);
         InsertChild(&T, p, i, c);
         printf("�� T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -164,7 +164,7 @@ int main(int argc, char* argv[]) {
         printf("�� ɾ���� T �� %c ���ĵ� %d ������ ...\n", p, i);
         DeleteChild(&T, p, i);
         printf("�� T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
diff --git a/VisualC++/CourseBook/0606_CTree/CTree.c b/VisualC++/CourseBook/0606_CTree/CTree.c
index d5540fd..8a5afc5 100644
--- a/VisualC++/CourseBook/0606_CTree/CTree.c
+++ b/VisualC++/CourseBook/0606_CTree/CTree.c
@@ -1259,7 +1259,7 @@ static void printPos(CTree T, Pos pt[]) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CTree T) {
+void PrintTree(CTree T) {
     Pos pt[MAX_TREE_SIZE];
     
     // ���������������������
diff --git a/VisualC++/CourseBook/0606_CTree/CTree.h b/VisualC++/CourseBook/0606_CTree/CTree.h
index 652adcf..9f4e308 100644
--- a/VisualC++/CourseBook/0606_CTree/CTree.h
+++ b/VisualC++/CourseBook/0606_CTree/CTree.h
@@ -243,7 +243,7 @@ static void printPos(CTree T, Pos pt[]);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CTree T);
+void PrintTree(CTree T);
 
 // ͼ�λ������ǰ�ṹ�ڲ�ʵ��
 static void Print(CTree T, Pos pt[], int i);
diff --git a/VisualC++/CourseBook/0607_CSTree/CSTree-main.c b/VisualC++/CourseBook/0607_CSTree/CSTree-main.c
index 5b96335..5b3864c 100644
--- a/VisualC++/CourseBook/0607_CSTree/CSTree-main.c
+++ b/VisualC++/CourseBook/0607_CSTree/CSTree-main.c
@@ -35,11 +35,11 @@ int main(int argc, char* argv[]) {
     PressEnterToContinue();
     
     
-    printf("���������������� PrintGraph \n");
+    printf("���������������� PrintTree \n");
     {
         printf("�� �����Ľṹ��ӡ�� T ...\n");
         printf("�� T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -83,7 +83,7 @@ int main(int argc, char* argv[]) {
         printf("�� ����� %c ��ֵΪ %c ...\n", e, value);
         Assign(T, e, value);
         printf("�� T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -146,12 +146,12 @@ int main(int argc, char* argv[]) {
         InitTree(&c);
         CreateTree(&c, "TestData_c.txt");
         printf("�� c = \n");
-        PrintGraph(c);
+        PrintTree(c);
         
         printf("�� ������ c ����Ϊ�� T �� %c ���ĵ� %d ������ ...\n", p, i);
         InsertChild(&T, p, i, c);
         printf("�� T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
@@ -164,7 +164,7 @@ int main(int argc, char* argv[]) {
         printf("�� ɾ���� T �� %c ���ĵ� %d ������ ...\n", p, i);
         DeleteChild(&T, p, i);
         printf("�� T = \n");
-        PrintGraph(T);
+        PrintTree(T);
     }
     PressEnterToContinue();
     
diff --git a/VisualC++/CourseBook/0607_CSTree/CSTree.c b/VisualC++/CourseBook/0607_CSTree/CSTree.c
index 6f8b140..dc6a579 100644
--- a/VisualC++/CourseBook/0607_CSTree/CSTree.c
+++ b/VisualC++/CourseBook/0607_CSTree/CSTree.c
@@ -678,7 +678,7 @@ static Status PostTraverse(CSTree T, Status(Visit)(TElemType)) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CSTree T) {
+void PrintTree(CSTree T) {
     
     // ���������������������
     if(TreeEmpty(T)) {
diff --git a/VisualC++/CourseBook/0607_CSTree/CSTree.h b/VisualC++/CourseBook/0607_CSTree/CSTree.h
index f135be6..49bf526 100644
--- a/VisualC++/CourseBook/0607_CSTree/CSTree.h
+++ b/VisualC++/CourseBook/0607_CSTree/CSTree.h
@@ -196,7 +196,7 @@ static Status PostTraverse(CSTree T, Status(Visit)(TElemType));
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CSTree T);
+void PrintTree(CSTree T);
 
 // ͼ�λ������ǰ�ṹ�ڲ�ʵ��
 static void Print(CSTree T, int row);
diff --git a/VisualC++/CourseBook/0608_MFSet/MFSet-main.c b/VisualC++/CourseBook/0608_MFSet/MFSet-main.c
index 5874ae7..2a4ac2f 100644
--- a/VisualC++/CourseBook/0608_MFSet/MFSet-main.c
+++ b/VisualC++/CourseBook/0608_MFSet/MFSet-main.c
@@ -31,10 +31,10 @@ int main(int argc, char* argv[]) {
     PressEnterToContinue();
     
     
-    printf("���������������� PrintGraph \n");
+    printf("���������������� PrintSet \n");
     {
         printf("�� ������� S ...\n");
-        PrintGraph(S);
+        PrintSet(S);
     }
     PressEnterToContinue();
     
@@ -47,7 +47,7 @@ int main(int argc, char* argv[]) {
         PrintRelation(R1);
 
         printf("�� ������� S ...\n");
-        PrintGraph(S);
+        PrintSet(S);
 
 
         printf("�� �Լ���Ӧ�ö�Ԫ��ϵ R2�� ");
@@ -55,7 +55,7 @@ int main(int argc, char* argv[]) {
         PrintRelation(R2);
 
         printf("�� ������� S ...\n");
-        PrintGraph(S);
+        PrintSet(S);
     }
     PressEnterToContinue();
     
@@ -68,7 +68,7 @@ int main(int argc, char* argv[]) {
 //        PrintRelation(R1);
 //
 //        printf("�� ������� S ...\n");
-//        PrintGraph(S);
+//        PrintSet(S);
 //
 //
 //        printf("�� �Լ���Ӧ�ö�Ԫ��ϵ R2�� ");
@@ -76,7 +76,7 @@ int main(int argc, char* argv[]) {
 //        PrintRelation(R2);
 //
 //        printf("�� ������� S ...\n");
-//        PrintGraph(S);
+//        PrintSet(S);
 //    }
 //    PressEnterToContinue();
     
diff --git a/VisualC++/CourseBook/0608_MFSet/MFSet.c b/VisualC++/CourseBook/0608_MFSet/MFSet.c
index 7f53c4d..42822d8 100644
--- a/VisualC++/CourseBook/0608_MFSet/MFSet.c
+++ b/VisualC++/CourseBook/0608_MFSet/MFSet.c
@@ -289,7 +289,7 @@ static void relation(Relation* R, FILE* fp) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(MFSet S) {
+void PrintSet(MFSet S) {
     typedef struct Elem {
         int x;
         struct Elem* next;
diff --git a/VisualC++/CourseBook/0608_MFSet/MFSet.h b/VisualC++/CourseBook/0608_MFSet/MFSet.h
index 2c9d401..b0db64b 100644
--- a/VisualC++/CourseBook/0608_MFSet/MFSet.h
+++ b/VisualC++/CourseBook/0608_MFSet/MFSet.h
@@ -155,7 +155,7 @@ static void relation(Relation* R, FILE* fp);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ����
-void PrintGraph(MFSet S);
+void PrintSet(MFSet S);
 
 // ͼ�λ�����������нṹ�������ڲ�����ʹ��
 static void PrintFramework(MFSet S);
diff --git a/VisualC++/CourseBook/CourseBook.sdf b/VisualC++/CourseBook/CourseBook.sdf
index 43990bf..ddc5ba7 100644
Binary files a/VisualC++/CourseBook/CourseBook.sdf and b/VisualC++/CourseBook/CourseBook.sdf differ
diff --git a/VisualC++/CourseBook/CourseBook.suo b/VisualC++/CourseBook/CourseBook.suo
index adac658..6299f65 100644
Binary files a/VisualC++/CourseBook/CourseBook.suo and b/VisualC++/CourseBook/CourseBook.suo differ
diff --git a/VisualC++/ExerciseBook/05.28-05.29/05.28-05.29.c b/VisualC++/ExerciseBook/05.28-05.29/05.28-05.29.c
index eb0a701..342eb2b 100644
--- a/VisualC++/ExerciseBook/05.28-05.29/05.28-05.29.c
+++ b/VisualC++/ExerciseBook/05.28-05.29/05.28-05.29.c
@@ -41,23 +41,23 @@ int main(int argc, char* argv[]) {
     printf("������Ԫ����ʽ...\n");
     CreateMPList(&P, p, "zyx");
     printf("P = ");
-    PrintGraph(P);
+    PrintMPList(P);
     CreateMPList(&Q, q, "zyx");
     printf("Q = ");
-    PrintGraph(Q);
+    PrintMPList(Q);
     
     // ���һԪ��ƫ����
     printf("P' = ");
     Algo_5_28(P, &PD);
-    PrintGraph(PD);
+    PrintMPList(PD);
     printf("Q' = ");
     Algo_5_28(Q, &QD);
-    PrintGraph(QD);
+    PrintMPList(QD);
 
     // ����ʽ�ӷ�
     printf("R = ");
     Algo_5_29(P, Q, &R);
-    PrintGraph(R);
+    PrintMPList(R);
 }
 
 
diff --git a/VisualC++/ExerciseBook/05.28-05.29/MPList.c b/VisualC++/ExerciseBook/05.28-05.29/MPList.c
index 1f08b74..5f66de6 100644
--- a/VisualC++/ExerciseBook/05.28-05.29/MPList.c
+++ b/VisualC++/ExerciseBook/05.28-05.29/MPList.c
@@ -111,7 +111,7 @@ static Status Create(MPList* P, char* S) {
  *
  * ���������mԪ����P��
  */
-void PrintGraph(MPList P) {
+void PrintMPList(MPList P) {
     if(P == NULL) {
         printf("\n");
         return;
diff --git a/VisualC++/ExerciseBook/05.28-05.29/MPList.h b/VisualC++/ExerciseBook/05.28-05.29/MPList.h
index 455e7ea..5c781f9 100644
--- a/VisualC++/ExerciseBook/05.28-05.29/MPList.h
+++ b/VisualC++/ExerciseBook/05.28-05.29/MPList.h
@@ -72,7 +72,7 @@ static Status Create(MPList* P, char* S);
  *
  * ���������mԪ����P��
  */
-void PrintGraph(MPList P);
+void PrintMPList(MPList P);
 
 /*
  * ͼ�λ�������ڲ�ʵ��
diff --git a/VisualC++/ExerciseBook/05.30.1/05.30.1.c b/VisualC++/ExerciseBook/05.30.1/05.30.1.c
index 00aefcc..4215515 100644
--- a/VisualC++/ExerciseBook/05.30.1/05.30.1.c
+++ b/VisualC++/ExerciseBook/05.30.1/05.30.1.c
@@ -15,7 +15,7 @@ int main(int argc, char* argv[]) {
     StrAssign(S, s);
     CreateGList(&L, S);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     printf("���������� %d\n", Algo_5_30_1(L));
     
diff --git a/VisualC++/ExerciseBook/05.30.1/GList-HT.c b/VisualC++/ExerciseBook/05.30.1/GList-HT.c
index bad30df..a761587 100644
--- a/VisualC++/ExerciseBook/05.30.1/GList-HT.c
+++ b/VisualC++/ExerciseBook/05.30.1/GList-HT.c
@@ -335,7 +335,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * ��������������L��
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L, Head);
     printf("\n");
 }
diff --git a/VisualC++/ExerciseBook/05.30.1/GList-HT.h b/VisualC++/ExerciseBook/05.30.1/GList-HT.h
index 508b96f..bc90362 100644
--- a/VisualC++/ExerciseBook/05.30.1/GList-HT.h
+++ b/VisualC++/ExerciseBook/05.30.1/GList-HT.h
@@ -143,7 +143,7 @@ void Traverse(GList L, void (Visit)(AtomType));
  *
  * ��������������L��
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * ͼ�λ�������ڲ�ʵ�֣�mark��ͼ�λ������ǡ�
diff --git a/VisualC++/ExerciseBook/05.30.2/05.30.2.c b/VisualC++/ExerciseBook/05.30.2/05.30.2.c
index 929561f..d45676d 100644
--- a/VisualC++/ExerciseBook/05.30.2/05.30.2.c
+++ b/VisualC++/ExerciseBook/05.30.2/05.30.2.c
@@ -15,7 +15,7 @@ int main(int argc, char* argv[]) {
     StrAssign(S, s);
     CreateGList(&L, S);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     printf("���������� %d\n", Algo_5_30_2(L));
     
diff --git a/VisualC++/ExerciseBook/05.30.2/GList-E.c b/VisualC++/ExerciseBook/05.30.2/GList-E.c
index 3fc0ad9..e5b2ccb 100644
--- a/VisualC++/ExerciseBook/05.30.2/GList-E.c
+++ b/VisualC++/ExerciseBook/05.30.2/GList-E.c
@@ -370,7 +370,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * ��������������L��
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L);
     printf("\n");
 }
diff --git a/VisualC++/ExerciseBook/05.30.2/GList-E.h b/VisualC++/ExerciseBook/05.30.2/GList-E.h
index fa9af82..b2b002c 100644
--- a/VisualC++/ExerciseBook/05.30.2/GList-E.h
+++ b/VisualC++/ExerciseBook/05.30.2/GList-E.h
@@ -126,7 +126,7 @@ void Traverse(GList L, void(Visit)(AtomType));
  *
  * ��������������L��
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * ͼ�λ�������ڲ�ʵ�֡�
diff --git a/VisualC++/ExerciseBook/05.31/05.31.c b/VisualC++/ExerciseBook/05.31/05.31.c
index da70a36..c453261 100644
--- a/VisualC++/ExerciseBook/05.31/05.31.c
+++ b/VisualC++/ExerciseBook/05.31/05.31.c
@@ -21,12 +21,12 @@ int main(int argc, char* argv[]) {
     StrAssign(S, s);
     CreateGList(&L, S);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     printf("���ƹ������ L �� T...\n");
     Algo_5_31(&T, L);
     printf("T = ");
-    PrintGraph(T);
+    PrintGList(T);
     
     return 0;
 }
diff --git a/VisualC++/ExerciseBook/05.31/GList-E.c b/VisualC++/ExerciseBook/05.31/GList-E.c
index 3fc0ad9..e5b2ccb 100644
--- a/VisualC++/ExerciseBook/05.31/GList-E.c
+++ b/VisualC++/ExerciseBook/05.31/GList-E.c
@@ -370,7 +370,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * ��������������L��
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L);
     printf("\n");
 }
diff --git a/VisualC++/ExerciseBook/05.31/GList-E.h b/VisualC++/ExerciseBook/05.31/GList-E.h
index fa9af82..b2b002c 100644
--- a/VisualC++/ExerciseBook/05.31/GList-E.h
+++ b/VisualC++/ExerciseBook/05.31/GList-E.h
@@ -126,7 +126,7 @@ void Traverse(GList L, void(Visit)(AtomType));
  *
  * ��������������L��
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * ͼ�λ�������ڲ�ʵ�֡�
diff --git a/VisualC++/ExerciseBook/05.32.1/05.32.1.c b/VisualC++/ExerciseBook/05.32.1/05.32.1.c
index 49d7e91..e5b114d 100644
--- a/VisualC++/ExerciseBook/05.32.1/05.32.1.c
+++ b/VisualC++/ExerciseBook/05.32.1/05.32.1.c
@@ -21,9 +21,9 @@ int main(int argc, char* argv[]) {
     StrAssign(Sb, b);
     CreateGList(&B, Sb);
     printf("A = ");
-    PrintGraph(A);
+    PrintGList(A);
     printf("B = ");
-    PrintGraph(B);
+    PrintGList(B);
     
     Algo_5_32_1(A, B) ? printf("���������ȣ�\n") : printf("�����������ȣ���\n");
     
diff --git a/VisualC++/ExerciseBook/05.32.1/GList-HT.c b/VisualC++/ExerciseBook/05.32.1/GList-HT.c
index bad30df..a761587 100644
--- a/VisualC++/ExerciseBook/05.32.1/GList-HT.c
+++ b/VisualC++/ExerciseBook/05.32.1/GList-HT.c
@@ -335,7 +335,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * ��������������L��
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L, Head);
     printf("\n");
 }
diff --git a/VisualC++/ExerciseBook/05.32.1/GList-HT.h b/VisualC++/ExerciseBook/05.32.1/GList-HT.h
index 508b96f..bc90362 100644
--- a/VisualC++/ExerciseBook/05.32.1/GList-HT.h
+++ b/VisualC++/ExerciseBook/05.32.1/GList-HT.h
@@ -143,7 +143,7 @@ void Traverse(GList L, void (Visit)(AtomType));
  *
  * ��������������L��
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * ͼ�λ�������ڲ�ʵ�֣�mark��ͼ�λ������ǡ�
diff --git a/VisualC++/ExerciseBook/05.32.2/05.32.2.c b/VisualC++/ExerciseBook/05.32.2/05.32.2.c
index adc2453..017ee2c 100644
--- a/VisualC++/ExerciseBook/05.32.2/05.32.2.c
+++ b/VisualC++/ExerciseBook/05.32.2/05.32.2.c
@@ -21,9 +21,9 @@ int main(int argc, char* argv[]) {
     StrAssign(Sb, b);
     CreateGList(&B, Sb);
     printf("A = ");
-    PrintGraph(A);
+    PrintGList(A);
     printf("B = ");
-    PrintGraph(B);
+    PrintGList(B);
     
     Algo_5_32_2(A, B) ? printf("���������ȣ�\n") : printf("�����������ȣ���\n");
     
diff --git a/VisualC++/ExerciseBook/05.32.2/GList-E.c b/VisualC++/ExerciseBook/05.32.2/GList-E.c
index 3fc0ad9..e5b2ccb 100644
--- a/VisualC++/ExerciseBook/05.32.2/GList-E.c
+++ b/VisualC++/ExerciseBook/05.32.2/GList-E.c
@@ -370,7 +370,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * ��������������L��
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L);
     printf("\n");
 }
diff --git a/VisualC++/ExerciseBook/05.32.2/GList-E.h b/VisualC++/ExerciseBook/05.32.2/GList-E.h
index fa9af82..b2b002c 100644
--- a/VisualC++/ExerciseBook/05.32.2/GList-E.h
+++ b/VisualC++/ExerciseBook/05.32.2/GList-E.h
@@ -126,7 +126,7 @@ void Traverse(GList L, void(Visit)(AtomType));
  *
  * ��������������L��
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * ͼ�λ�������ڲ�ʵ�֡�
diff --git a/VisualC++/ExerciseBook/05.33.1/05.33.1.c b/VisualC++/ExerciseBook/05.33.1/05.33.1.c
index 0ee6f53..b8ab343 100644
--- a/VisualC++/ExerciseBook/05.33.1/05.33.1.c
+++ b/VisualC++/ExerciseBook/05.33.1/05.33.1.c
@@ -17,7 +17,7 @@ int main(int argc, char* argv[]) {
     StrAssign(S, s);
     CreateGList(&L, S);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     Algo_5_33_1(L, 0);
     
diff --git a/VisualC++/ExerciseBook/05.33.1/GList-HT.c b/VisualC++/ExerciseBook/05.33.1/GList-HT.c
index bad30df..a761587 100644
--- a/VisualC++/ExerciseBook/05.33.1/GList-HT.c
+++ b/VisualC++/ExerciseBook/05.33.1/GList-HT.c
@@ -335,7 +335,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * ��������������L��
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L, Head);
     printf("\n");
 }
diff --git a/VisualC++/ExerciseBook/05.33.1/GList-HT.h b/VisualC++/ExerciseBook/05.33.1/GList-HT.h
index 508b96f..bc90362 100644
--- a/VisualC++/ExerciseBook/05.33.1/GList-HT.h
+++ b/VisualC++/ExerciseBook/05.33.1/GList-HT.h
@@ -143,7 +143,7 @@ void Traverse(GList L, void (Visit)(AtomType));
  *
  * ��������������L��
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * ͼ�λ�������ڲ�ʵ�֣�mark��ͼ�λ������ǡ�
diff --git a/VisualC++/ExerciseBook/05.33.2/05.33.2.c b/VisualC++/ExerciseBook/05.33.2/05.33.2.c
index 11aa567..25dbee3 100644
--- a/VisualC++/ExerciseBook/05.33.2/05.33.2.c
+++ b/VisualC++/ExerciseBook/05.33.2/05.33.2.c
@@ -17,7 +17,7 @@ int main(int argc, char* argv[]) {
     StrAssign(S, s);
     CreateGList(&L, S);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     Algo_5_33_2(L, 0);
     
diff --git a/VisualC++/ExerciseBook/05.33.2/GList-E.c b/VisualC++/ExerciseBook/05.33.2/GList-E.c
index 3fc0ad9..e5b2ccb 100644
--- a/VisualC++/ExerciseBook/05.33.2/GList-E.c
+++ b/VisualC++/ExerciseBook/05.33.2/GList-E.c
@@ -370,7 +370,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * ��������������L��
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L);
     printf("\n");
 }
diff --git a/VisualC++/ExerciseBook/05.33.2/GList-E.h b/VisualC++/ExerciseBook/05.33.2/GList-E.h
index fa9af82..b2b002c 100644
--- a/VisualC++/ExerciseBook/05.33.2/GList-E.h
+++ b/VisualC++/ExerciseBook/05.33.2/GList-E.h
@@ -126,7 +126,7 @@ void Traverse(GList L, void(Visit)(AtomType));
  *
  * ��������������L��
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * ͼ�λ�������ڲ�ʵ�֡�
diff --git a/VisualC++/ExerciseBook/05.34.1/05.34.1.c b/VisualC++/ExerciseBook/05.34.1/05.34.1.c
index b3a2013..014f69b 100644
--- a/VisualC++/ExerciseBook/05.34.1/05.34.1.c
+++ b/VisualC++/ExerciseBook/05.34.1/05.34.1.c
@@ -18,12 +18,12 @@ int main(int argc, char* argv[]) {
     StrAssign(S, s);
     CreateGList(&L, S);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     printf("���ù����...\n");
     Algo_5_34_1(&L);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     return 0;
 }
diff --git a/VisualC++/ExerciseBook/05.34.1/GList-HT.c b/VisualC++/ExerciseBook/05.34.1/GList-HT.c
index bad30df..a761587 100644
--- a/VisualC++/ExerciseBook/05.34.1/GList-HT.c
+++ b/VisualC++/ExerciseBook/05.34.1/GList-HT.c
@@ -335,7 +335,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * ��������������L��
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L, Head);
     printf("\n");
 }
diff --git a/VisualC++/ExerciseBook/05.34.1/GList-HT.h b/VisualC++/ExerciseBook/05.34.1/GList-HT.h
index 508b96f..bc90362 100644
--- a/VisualC++/ExerciseBook/05.34.1/GList-HT.h
+++ b/VisualC++/ExerciseBook/05.34.1/GList-HT.h
@@ -143,7 +143,7 @@ void Traverse(GList L, void (Visit)(AtomType));
  *
  * ��������������L��
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * ͼ�λ�������ڲ�ʵ�֣�mark��ͼ�λ������ǡ�
diff --git a/VisualC++/ExerciseBook/05.34.2/05.34.2.c b/VisualC++/ExerciseBook/05.34.2/05.34.2.c
index c72e80d..39249be 100644
--- a/VisualC++/ExerciseBook/05.34.2/05.34.2.c
+++ b/VisualC++/ExerciseBook/05.34.2/05.34.2.c
@@ -18,12 +18,12 @@ int main(int argc, char* argv[]) {
     StrAssign(S, s);
     CreateGList(&L, S);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     printf("���ù����...\n");
     Algo_5_34_2(&L);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     return 0;
 }
diff --git a/VisualC++/ExerciseBook/05.34.2/GList-E.c b/VisualC++/ExerciseBook/05.34.2/GList-E.c
index 3fc0ad9..e5b2ccb 100644
--- a/VisualC++/ExerciseBook/05.34.2/GList-E.c
+++ b/VisualC++/ExerciseBook/05.34.2/GList-E.c
@@ -370,7 +370,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * ��������������L��
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L);
     printf("\n");
 }
diff --git a/VisualC++/ExerciseBook/05.34.2/GList-E.h b/VisualC++/ExerciseBook/05.34.2/GList-E.h
index fa9af82..b2b002c 100644
--- a/VisualC++/ExerciseBook/05.34.2/GList-E.h
+++ b/VisualC++/ExerciseBook/05.34.2/GList-E.h
@@ -126,7 +126,7 @@ void Traverse(GList L, void(Visit)(AtomType));
  *
  * ��������������L��
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * ͼ�λ�������ڲ�ʵ�֡�
diff --git a/VisualC++/ExerciseBook/05.35-05.36/05.35-05.36.c b/VisualC++/ExerciseBook/05.35-05.36/05.35-05.36.c
index 615ee5e..f7da4b3 100644
--- a/VisualC++/ExerciseBook/05.35-05.36/05.35-05.36.c
+++ b/VisualC++/ExerciseBook/05.35-05.36/05.35-05.36.c
@@ -41,5 +41,5 @@ Status Algo_5_35(GList* L, SString S) {
  * ��������������L�����ｫ"( )"����Ϊ�����Ϊ�յ�״̬��
  */
 void Algo_5_36(GList L) {
-    PrintGraph(L);
+    PrintGList(L);
 }
diff --git a/VisualC++/ExerciseBook/05.35-05.36/GList.c b/VisualC++/ExerciseBook/05.35-05.36/GList.c
index 3956155..efefa10 100644
--- a/VisualC++/ExerciseBook/05.35-05.36/GList.c
+++ b/VisualC++/ExerciseBook/05.35-05.36/GList.c
@@ -96,7 +96,7 @@ Status CreateGList(GList* L, SString S) {
  *��ע��
  * ���ｫ"( )"����Ϊ�����Ϊ�յ�״̬��
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L, Head);
     printf("\n");
 }
diff --git a/VisualC++/ExerciseBook/05.35-05.36/GList.h b/VisualC++/ExerciseBook/05.35-05.36/GList.h
index c9837e7..1a19e26 100644
--- a/VisualC++/ExerciseBook/05.35-05.36/GList.h
+++ b/VisualC++/ExerciseBook/05.35-05.36/GList.h
@@ -61,7 +61,7 @@ Status CreateGList(GList* L, SString S);
  *
  * ��������������L��
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * ͼ�λ�������ڲ�ʵ�֣�mark��ͼ�λ������ǡ�
diff --git a/VisualC++/ExerciseBook/05.37.1/05.37.1.c b/VisualC++/ExerciseBook/05.37.1/05.37.1.c
index 11b37d6..cfdcdc9 100644
--- a/VisualC++/ExerciseBook/05.37.1/05.37.1.c
+++ b/VisualC++/ExerciseBook/05.37.1/05.37.1.c
@@ -17,12 +17,12 @@ int main(int argc, char* argv[]) {
     StrAssign(S, s);
     CreateGList(&L, S);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     printf("ɾ�� L �е�Ԫ�� 'b' ...\n");
     Algo_5_37_1(&L, 'b');
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     return 0;
 }
diff --git a/VisualC++/ExerciseBook/05.37.1/GList-HT.c b/VisualC++/ExerciseBook/05.37.1/GList-HT.c
index bad30df..a761587 100644
--- a/VisualC++/ExerciseBook/05.37.1/GList-HT.c
+++ b/VisualC++/ExerciseBook/05.37.1/GList-HT.c
@@ -335,7 +335,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * ��������������L��
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L, Head);
     printf("\n");
 }
diff --git a/VisualC++/ExerciseBook/05.37.1/GList-HT.h b/VisualC++/ExerciseBook/05.37.1/GList-HT.h
index 508b96f..bc90362 100644
--- a/VisualC++/ExerciseBook/05.37.1/GList-HT.h
+++ b/VisualC++/ExerciseBook/05.37.1/GList-HT.h
@@ -143,7 +143,7 @@ void Traverse(GList L, void (Visit)(AtomType));
  *
  * ��������������L��
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * ͼ�λ�������ڲ�ʵ�֣�mark��ͼ�λ������ǡ�
diff --git a/VisualC++/ExerciseBook/05.37.2/05.37.2.c b/VisualC++/ExerciseBook/05.37.2/05.37.2.c
index 9e5afb1..aa6e2f8 100644
--- a/VisualC++/ExerciseBook/05.37.2/05.37.2.c
+++ b/VisualC++/ExerciseBook/05.37.2/05.37.2.c
@@ -18,12 +18,12 @@ int main(int argc, char* argv[]) {
     StrAssign(S, s);
     CreateGList(&L, S);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     printf("ɾ�� L �е�Ԫ�� 'b' ...\n");
     Algo_5_37_2(&L, 'b');
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     return 0;
 }
diff --git a/VisualC++/ExerciseBook/05.37.2/GList-E.c b/VisualC++/ExerciseBook/05.37.2/GList-E.c
index 3fc0ad9..e5b2ccb 100644
--- a/VisualC++/ExerciseBook/05.37.2/GList-E.c
+++ b/VisualC++/ExerciseBook/05.37.2/GList-E.c
@@ -370,7 +370,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * ��������������L��
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L);
     printf("\n");
 }
diff --git a/VisualC++/ExerciseBook/05.37.2/GList-E.h b/VisualC++/ExerciseBook/05.37.2/GList-E.h
index fa9af82..b2b002c 100644
--- a/VisualC++/ExerciseBook/05.37.2/GList-E.h
+++ b/VisualC++/ExerciseBook/05.37.2/GList-E.h
@@ -126,7 +126,7 @@ void Traverse(GList L, void(Visit)(AtomType));
  *
  * ��������������L��
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * ͼ�λ�������ڲ�ʵ�֡�
diff --git a/VisualC++/ExerciseBook/05.38.1/05.38.1.c b/VisualC++/ExerciseBook/05.38.1/05.38.1.c
index c41ea76..5c6cd08 100644
--- a/VisualC++/ExerciseBook/05.38.1/05.38.1.c
+++ b/VisualC++/ExerciseBook/05.38.1/05.38.1.c
@@ -17,7 +17,7 @@ int main(int argc, char* argv[]) {
     StrAssign(S, s);
     CreateGList(&L, S);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     printf("������� 2 ���ԭ����Ϊ��");
     Algo_5_38_1(L, 0, 2);
diff --git a/VisualC++/ExerciseBook/05.38.1/GList-HT.c b/VisualC++/ExerciseBook/05.38.1/GList-HT.c
index bad30df..a761587 100644
--- a/VisualC++/ExerciseBook/05.38.1/GList-HT.c
+++ b/VisualC++/ExerciseBook/05.38.1/GList-HT.c
@@ -335,7 +335,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * ��������������L��
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L, Head);
     printf("\n");
 }
diff --git a/VisualC++/ExerciseBook/05.38.1/GList-HT.h b/VisualC++/ExerciseBook/05.38.1/GList-HT.h
index 508b96f..bc90362 100644
--- a/VisualC++/ExerciseBook/05.38.1/GList-HT.h
+++ b/VisualC++/ExerciseBook/05.38.1/GList-HT.h
@@ -143,7 +143,7 @@ void Traverse(GList L, void (Visit)(AtomType));
  *
  * ��������������L��
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * ͼ�λ�������ڲ�ʵ�֣�mark��ͼ�λ������ǡ�
diff --git a/VisualC++/ExerciseBook/05.38.2/05.38.2.c b/VisualC++/ExerciseBook/05.38.2/05.38.2.c
index ed3096f..1951c1e 100644
--- a/VisualC++/ExerciseBook/05.38.2/05.38.2.c
+++ b/VisualC++/ExerciseBook/05.38.2/05.38.2.c
@@ -17,7 +17,7 @@ int main(int argc, char* argv[]) {
     StrAssign(S, s);
     CreateGList(&L, S);
     printf("L = ");
-    PrintGraph(L);
+    PrintGList(L);
     
     printf("������� 2 ���ԭ����Ϊ��");
     Algo_5_38_2(L, 0, 2);
diff --git a/VisualC++/ExerciseBook/05.38.2/GList-E.c b/VisualC++/ExerciseBook/05.38.2/GList-E.c
index 3fc0ad9..e5b2ccb 100644
--- a/VisualC++/ExerciseBook/05.38.2/GList-E.c
+++ b/VisualC++/ExerciseBook/05.38.2/GList-E.c
@@ -370,7 +370,7 @@ void Traverse(GList L, void(Visit)(AtomType)) {
  *
  * ��������������L��
  */
-void PrintGraph(GList L) {
+void PrintGList(GList L) {
     Print(L);
     printf("\n");
 }
diff --git a/VisualC++/ExerciseBook/05.38.2/GList-E.h b/VisualC++/ExerciseBook/05.38.2/GList-E.h
index fa9af82..b2b002c 100644
--- a/VisualC++/ExerciseBook/05.38.2/GList-E.h
+++ b/VisualC++/ExerciseBook/05.38.2/GList-E.h
@@ -126,7 +126,7 @@ void Traverse(GList L, void(Visit)(AtomType));
  *
  * ��������������L��
  */
-void PrintGraph(GList L);
+void PrintGList(GList L);
 
 /*
  * ͼ�λ�������ڲ�ʵ�֡�
diff --git a/VisualC++/ExerciseBook/06.36/06.36.c b/VisualC++/ExerciseBook/06.36/06.36.c
index f817b66..29a1fa4 100644
--- a/VisualC++/ExerciseBook/06.36/06.36.c
+++ b/VisualC++/ExerciseBook/06.36/06.36.c
@@ -13,17 +13,17 @@ int main(int argc, char* argv[]) {
     
     printf("���������� B1 ��...\n");
     CreateBiTree(&B1, "TestData_B1.txt");
-    PrintGraph(B1);
+    PrintTree(B1);
     printf("\n");
     
     printf("���������� B2 ��...\n");
     CreateBiTree(&B2, "TestData_B2.txt");
-    PrintGraph(B2);
+    PrintTree(B2);
     printf("\n");
     
     printf("���������� B3 ��...\n");
     CreateBiTree(&B3, "TestData_B3.txt");
-    PrintGraph(B3);
+    PrintTree(B3);
     printf("\n");
     
     if(Algo_6_36(B1, B2) == TRUE) {
diff --git a/VisualC++/ExerciseBook/06.36/BiTree.c b/VisualC++/ExerciseBook/06.36/BiTree.c
index 97a2156..6ac85ce 100644
--- a/VisualC++/ExerciseBook/06.36/BiTree.c
+++ b/VisualC++/ExerciseBook/06.36/BiTree.c
@@ -107,7 +107,7 @@ static void CreateTree(BiTree* T, FILE* fp) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/VisualC++/ExerciseBook/06.36/BiTree.h b/VisualC++/ExerciseBook/06.36/BiTree.h
index f4d29c5..a05d724 100644
--- a/VisualC++/ExerciseBook/06.36/BiTree.h
+++ b/VisualC++/ExerciseBook/06.36/BiTree.h
@@ -71,6 +71,6 @@ static void CreateTree(BiTree* T, FILE* fp);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/VisualC++/ExerciseBook/06.37-06.38/06.37-06.38.c b/VisualC++/ExerciseBook/06.37-06.38/06.37-06.38.c
index e19a4da..bd04477 100644
--- a/VisualC++/ExerciseBook/06.37-06.38/06.37-06.38.c
+++ b/VisualC++/ExerciseBook/06.37-06.38/06.37-06.38.c
@@ -19,7 +19,7 @@ int main(int argc, char* argv[]) {
     
     printf("���������� T ��...\n");
     CreateBiTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("�������� 6.37 ��֤...������\n");
diff --git a/VisualC++/ExerciseBook/06.37-06.38/BiTree.c b/VisualC++/ExerciseBook/06.37-06.38/BiTree.c
index 97a2156..6ac85ce 100644
--- a/VisualC++/ExerciseBook/06.37-06.38/BiTree.c
+++ b/VisualC++/ExerciseBook/06.37-06.38/BiTree.c
@@ -107,7 +107,7 @@ static void CreateTree(BiTree* T, FILE* fp) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/VisualC++/ExerciseBook/06.37-06.38/BiTree.h b/VisualC++/ExerciseBook/06.37-06.38/BiTree.h
index f4d29c5..a05d724 100644
--- a/VisualC++/ExerciseBook/06.37-06.38/BiTree.h
+++ b/VisualC++/ExerciseBook/06.37-06.38/BiTree.h
@@ -71,6 +71,6 @@ static void CreateTree(BiTree* T, FILE* fp);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/VisualC++/ExerciseBook/06.41-06.49/06.41-06.49.c b/VisualC++/ExerciseBook/06.41-06.49/06.41-06.49.c
index fdb211e..4710d86 100644
--- a/VisualC++/ExerciseBook/06.41-06.49/06.41-06.49.c
+++ b/VisualC++/ExerciseBook/06.41-06.49/06.41-06.49.c
@@ -66,7 +66,7 @@ int main(int argc, char* argv[]) {
     printf("���������� T ...\n");
     InitBiTree(&T);
     CreateBiTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("�������� 6.41 ��֤...������\n");
@@ -94,7 +94,7 @@ int main(int argc, char* argv[]) {
     {
         printf("�����������������������������\n");
         Algo_6_43(T);
-        PrintGraph(T);
+        PrintTree(T);
         printf("\n");
     }
     
@@ -112,7 +112,7 @@ int main(int argc, char* argv[]) {
         
         printf("ɾ������ %c �󣬶�����Ϊ��\n", x);
         if(Algo_6_45(&T, x)) {
-            PrintGraph(T);
+            PrintTree(T);
         }
         printf("\n");
     }
@@ -123,7 +123,7 @@ int main(int argc, char* argv[]) {
         
         printf("���� T �� Tx �󣬶�����TxΪ��\n");
         Algo_6_46(T, &Tx);
-        PrintGraph(Tx);
+        PrintTree(Tx);
         printf("\n");
     }
     
diff --git a/VisualC++/ExerciseBook/06.41-06.49/BiTree.c b/VisualC++/ExerciseBook/06.41-06.49/BiTree.c
index 3491ed2..7ab7f01 100644
--- a/VisualC++/ExerciseBook/06.41-06.49/BiTree.c
+++ b/VisualC++/ExerciseBook/06.41-06.49/BiTree.c
@@ -149,7 +149,7 @@ static void CreateTree(BiTree* T, FILE* fp) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/VisualC++/ExerciseBook/06.41-06.49/BiTree.h b/VisualC++/ExerciseBook/06.41-06.49/BiTree.h
index ba89b3e..52fd4a0 100644
--- a/VisualC++/ExerciseBook/06.41-06.49/BiTree.h
+++ b/VisualC++/ExerciseBook/06.41-06.49/BiTree.h
@@ -85,6 +85,6 @@ static void CreateTree(BiTree* T, FILE* fp);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/VisualC++/ExerciseBook/06.50/06.50.c b/VisualC++/ExerciseBook/06.50/06.50.c
index e4d9899..fd3cb23 100644
--- a/VisualC++/ExerciseBook/06.50/06.50.c
+++ b/VisualC++/ExerciseBook/06.50/06.50.c
@@ -22,7 +22,7 @@ int main(int argc, char* argv[]) {
     printf("\n");
     
     printf("������T��\n");
-    PrintGraph(T);
+    PrintTree(T);
     
     return 0;
 }
diff --git a/VisualC++/ExerciseBook/06.50/BiTree.c b/VisualC++/ExerciseBook/06.50/BiTree.c
index 76327ed..f772f85 100644
--- a/VisualC++/ExerciseBook/06.50/BiTree.c
+++ b/VisualC++/ExerciseBook/06.50/BiTree.c
@@ -50,7 +50,7 @@ int BiTreeDepth(BiTree T) {
 }
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/VisualC++/ExerciseBook/06.50/BiTree.h b/VisualC++/ExerciseBook/06.50/BiTree.h
index d53885f..3ab5bf3 100644
--- a/VisualC++/ExerciseBook/06.50/BiTree.h
+++ b/VisualC++/ExerciseBook/06.50/BiTree.h
@@ -49,6 +49,6 @@ Status BiTreeEmpty(BiTree T);
 int BiTreeDepth(BiTree T);
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/VisualC++/ExerciseBook/06.51/06.51.c b/VisualC++/ExerciseBook/06.51/06.51.c
index 8dfa052..eb334e8 100644
--- a/VisualC++/ExerciseBook/06.51/06.51.c
+++ b/VisualC++/ExerciseBook/06.51/06.51.c
@@ -20,7 +20,7 @@ int main(int argc, char* argv[]) {
     printf("��������������������T...\n");
     InitBiTree(&T);
     CreateBiTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("�����������ʽ��");
diff --git a/VisualC++/ExerciseBook/06.51/BiTree.c b/VisualC++/ExerciseBook/06.51/BiTree.c
index 3491ed2..7ab7f01 100644
--- a/VisualC++/ExerciseBook/06.51/BiTree.c
+++ b/VisualC++/ExerciseBook/06.51/BiTree.c
@@ -149,7 +149,7 @@ static void CreateTree(BiTree* T, FILE* fp) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/VisualC++/ExerciseBook/06.51/BiTree.h b/VisualC++/ExerciseBook/06.51/BiTree.h
index ba89b3e..52fd4a0 100644
--- a/VisualC++/ExerciseBook/06.51/BiTree.h
+++ b/VisualC++/ExerciseBook/06.51/BiTree.h
@@ -85,6 +85,6 @@ static void CreateTree(BiTree* T, FILE* fp);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/VisualC++/ExerciseBook/06.52/06.52.c b/VisualC++/ExerciseBook/06.52/06.52.c
index 49b08f3..6916937 100644
--- a/VisualC++/ExerciseBook/06.52/06.52.c
+++ b/VisualC++/ExerciseBook/06.52/06.52.c
@@ -17,7 +17,7 @@ int main(int argc, char* argv[]) {
     printf("��������������������T...\n");
     InitBiTree(&T);
     CreateBiTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("���ķ�ï��Ϊ�� %d", Algo_6_52(T));
diff --git a/VisualC++/ExerciseBook/06.52/BiTree.c b/VisualC++/ExerciseBook/06.52/BiTree.c
index 3491ed2..7ab7f01 100644
--- a/VisualC++/ExerciseBook/06.52/BiTree.c
+++ b/VisualC++/ExerciseBook/06.52/BiTree.c
@@ -149,7 +149,7 @@ static void CreateTree(BiTree* T, FILE* fp) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/VisualC++/ExerciseBook/06.52/BiTree.h b/VisualC++/ExerciseBook/06.52/BiTree.h
index ba89b3e..52fd4a0 100644
--- a/VisualC++/ExerciseBook/06.52/BiTree.h
+++ b/VisualC++/ExerciseBook/06.52/BiTree.h
@@ -85,6 +85,6 @@ static void CreateTree(BiTree* T, FILE* fp);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/VisualC++/ExerciseBook/06.53/06.53.c b/VisualC++/ExerciseBook/06.53/06.53.c
index 0e615b1..00a8238 100644
--- a/VisualC++/ExerciseBook/06.53/06.53.c
+++ b/VisualC++/ExerciseBook/06.53/06.53.c
@@ -18,7 +18,7 @@ int main(int argc, char* argv[]) {
     printf("��������������������T...\n");
     InitBiTree(&T);
     CreateBiTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("�������㵽Ҷ�ӽ���·��������һ����");
diff --git a/VisualC++/ExerciseBook/06.53/BiTree.c b/VisualC++/ExerciseBook/06.53/BiTree.c
index 3491ed2..7ab7f01 100644
--- a/VisualC++/ExerciseBook/06.53/BiTree.c
+++ b/VisualC++/ExerciseBook/06.53/BiTree.c
@@ -149,7 +149,7 @@ static void CreateTree(BiTree* T, FILE* fp) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/VisualC++/ExerciseBook/06.53/BiTree.h b/VisualC++/ExerciseBook/06.53/BiTree.h
index ba89b3e..52fd4a0 100644
--- a/VisualC++/ExerciseBook/06.53/BiTree.h
+++ b/VisualC++/ExerciseBook/06.53/BiTree.h
@@ -85,6 +85,6 @@ static void CreateTree(BiTree* T, FILE* fp);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/VisualC++/ExerciseBook/06.54/06.54.c b/VisualC++/ExerciseBook/06.54/06.54.c
index 41a7070..250143e 100644
--- a/VisualC++/ExerciseBook/06.54/06.54.c
+++ b/VisualC++/ExerciseBook/06.54/06.54.c
@@ -17,7 +17,7 @@ int main(int argc, char* argv[]) {
    
     printf("��������������������...\n");
     Algo_6_54(&T, sa);
-    PrintGraph(T);
+    PrintTree(T);
     
     return 0;
 }
diff --git a/VisualC++/ExerciseBook/06.54/BiTree.c b/VisualC++/ExerciseBook/06.54/BiTree.c
index 76327ed..f772f85 100644
--- a/VisualC++/ExerciseBook/06.54/BiTree.c
+++ b/VisualC++/ExerciseBook/06.54/BiTree.c
@@ -50,7 +50,7 @@ int BiTreeDepth(BiTree T) {
 }
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/VisualC++/ExerciseBook/06.54/BiTree.h b/VisualC++/ExerciseBook/06.54/BiTree.h
index d53885f..3ab5bf3 100644
--- a/VisualC++/ExerciseBook/06.54/BiTree.h
+++ b/VisualC++/ExerciseBook/06.54/BiTree.h
@@ -49,6 +49,6 @@ Status BiTreeEmpty(BiTree T);
 int BiTreeDepth(BiTree T);
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/VisualC++/ExerciseBook/06.55/06.55.c b/VisualC++/ExerciseBook/06.55/06.55.c
index 916f194..fa8956e 100644
--- a/VisualC++/ExerciseBook/06.55/06.55.c
+++ b/VisualC++/ExerciseBook/06.55/06.55.c
@@ -18,7 +18,7 @@ int main(int argc, char* argv[]) {
     printf("��������������������T...\n");
     InitBiTree(&T);
     CreateBiTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("����������������ֵ������Ӧ��������Ŀ��\n");
diff --git a/VisualC++/ExerciseBook/06.55/BiTree.c b/VisualC++/ExerciseBook/06.55/BiTree.c
index 3491ed2..7ab7f01 100644
--- a/VisualC++/ExerciseBook/06.55/BiTree.c
+++ b/VisualC++/ExerciseBook/06.55/BiTree.c
@@ -149,7 +149,7 @@ static void CreateTree(BiTree* T, FILE* fp) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/VisualC++/ExerciseBook/06.55/BiTree.h b/VisualC++/ExerciseBook/06.55/BiTree.h
index 425dfa1..e3fb736 100644
--- a/VisualC++/ExerciseBook/06.55/BiTree.h
+++ b/VisualC++/ExerciseBook/06.55/BiTree.h
@@ -87,6 +87,6 @@ static void CreateTree(BiTree* T, FILE* fp);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/VisualC++/ExerciseBook/06.59-06.62/06.59-06.62.c b/VisualC++/ExerciseBook/06.59-06.62/06.59-06.62.c
index 994ec7f..c889d1a 100644
--- a/VisualC++/ExerciseBook/06.59-06.62/06.59-06.62.c
+++ b/VisualC++/ExerciseBook/06.59-06.62/06.59-06.62.c
@@ -31,7 +31,7 @@ int main(int argc, char* argv[]) {
     printf("����������������T...\n");
     InitTree(&T);
     CreateTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("�������� 6.59 ��֤...������\n");
diff --git a/VisualC++/ExerciseBook/06.59-06.62/CSTree.c b/VisualC++/ExerciseBook/06.59-06.62/CSTree.c
index 64d258f..387a571 100644
--- a/VisualC++/ExerciseBook/06.59-06.62/CSTree.c
+++ b/VisualC++/ExerciseBook/06.59-06.62/CSTree.c
@@ -128,7 +128,7 @@ static void Depth(CSTree T, int d, int* max) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CSTree T) {
+void PrintTree(CSTree T) {
     
     // ���������������������
     if(TreeEmpty(T)) {
diff --git a/VisualC++/ExerciseBook/06.59-06.62/CSTree.h b/VisualC++/ExerciseBook/06.59-06.62/CSTree.h
index 3d95beb..1bd284a 100644
--- a/VisualC++/ExerciseBook/06.59-06.62/CSTree.h
+++ b/VisualC++/ExerciseBook/06.59-06.62/CSTree.h
@@ -79,7 +79,7 @@ static void Depth(CSTree T, int d, int *max);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CSTree T);
+void PrintTree(CSTree T);
 
 // ͼ�λ������ǰ�ṹ�ڲ�ʵ��
 static void Print(CSTree T, int row);
diff --git a/VisualC++/ExerciseBook/06.63/06.63.c b/VisualC++/ExerciseBook/06.63/06.63.c
index dc1592e..94984d8 100644
--- a/VisualC++/ExerciseBook/06.63/06.63.c
+++ b/VisualC++/ExerciseBook/06.63/06.63.c
@@ -14,7 +14,7 @@ int main(int argc, char* argv[]) {
     printf("������T...\n");
     InitTree(&T);
     CreateTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("����������� %d\n", Algo_6_63(T));
diff --git a/VisualC++/ExerciseBook/06.63/CTree.c b/VisualC++/ExerciseBook/06.63/CTree.c
index d2c194a..4874394 100644
--- a/VisualC++/ExerciseBook/06.63/CTree.c
+++ b/VisualC++/ExerciseBook/06.63/CTree.c
@@ -313,7 +313,7 @@ static void getPos(CTree T, Pos pt[]) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CTree T) {
+void PrintTree(CTree T) {
     Pos pt[MAX_TREE_SIZE];
     
     // ���������������������
diff --git a/VisualC++/ExerciseBook/06.63/CTree.h b/VisualC++/ExerciseBook/06.63/CTree.h
index 873504b..2fdd34b 100644
--- a/VisualC++/ExerciseBook/06.63/CTree.h
+++ b/VisualC++/ExerciseBook/06.63/CTree.h
@@ -118,7 +118,7 @@ static void getPos(CTree T, Pos pt[]);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CTree T);
+void PrintTree(CTree T);
 
 // ͼ�λ������ǰ�ṹ�ڲ�ʵ��
 static void Print(CTree T, Pos pt[], int i);
diff --git a/VisualC++/ExerciseBook/06.64/06.64.c b/VisualC++/ExerciseBook/06.64/06.64.c
index 2af54e0..78db19e 100644
--- a/VisualC++/ExerciseBook/06.64/06.64.c
+++ b/VisualC++/ExerciseBook/06.64/06.64.c
@@ -14,7 +14,7 @@ int main(int argc, char* argv[]) {
     printf("������T...\n");
     InitTree(&T);
     CreateTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("����������� %d\n", Algo_6_64(T));
diff --git a/VisualC++/ExerciseBook/06.64/PTree.c b/VisualC++/ExerciseBook/06.64/PTree.c
index 69fd054..5690658 100644
--- a/VisualC++/ExerciseBook/06.64/PTree.c
+++ b/VisualC++/ExerciseBook/06.64/PTree.c
@@ -274,7 +274,7 @@ static void getPos(PTree T, Pos pt[]) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(PTree T) {
+void PrintTree(PTree T) {
     Pos pt[MAX_TREE_SIZE];
     
     // ���������������������
diff --git a/VisualC++/ExerciseBook/06.64/PTree.h b/VisualC++/ExerciseBook/06.64/PTree.h
index c47c6ed..607de6a 100644
--- a/VisualC++/ExerciseBook/06.64/PTree.h
+++ b/VisualC++/ExerciseBook/06.64/PTree.h
@@ -106,7 +106,7 @@ static void getPos(PTree T, Pos pt[]);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(PTree T);
+void PrintTree(PTree T);
 
 // ͼ�λ������ǰ�ṹ�ڲ�ʵ��
 static void Print(PTree T, Pos pt[], int i);
diff --git a/VisualC++/ExerciseBook/06.65/06.65.c b/VisualC++/ExerciseBook/06.65/06.65.c
index 58c798b..6bd939c 100644
--- a/VisualC++/ExerciseBook/06.65/06.65.c
+++ b/VisualC++/ExerciseBook/06.65/06.65.c
@@ -26,7 +26,7 @@ int main(int argc, char* argv[]) {
     
     printf("�ɴ˹���Ķ�����Ϊ T = \n");
     Algo_6_65(&T);
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     return 0;
diff --git a/VisualC++/ExerciseBook/06.65/BiTree.c b/VisualC++/ExerciseBook/06.65/BiTree.c
index 76327ed..f772f85 100644
--- a/VisualC++/ExerciseBook/06.65/BiTree.c
+++ b/VisualC++/ExerciseBook/06.65/BiTree.c
@@ -50,7 +50,7 @@ int BiTreeDepth(BiTree T) {
 }
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/VisualC++/ExerciseBook/06.65/BiTree.h b/VisualC++/ExerciseBook/06.65/BiTree.h
index d53885f..3ab5bf3 100644
--- a/VisualC++/ExerciseBook/06.65/BiTree.h
+++ b/VisualC++/ExerciseBook/06.65/BiTree.h
@@ -49,6 +49,6 @@ Status BiTreeEmpty(BiTree T);
 int BiTreeDepth(BiTree T);
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/VisualC++/ExerciseBook/06.66/06.66.c b/VisualC++/ExerciseBook/06.66/06.66.c
index df12be3..94b905d 100644
--- a/VisualC++/ExerciseBook/06.66/06.66.c
+++ b/VisualC++/ExerciseBook/06.66/06.66.c
@@ -17,12 +17,12 @@ int main(int argc, char* argv[]) {
     printf("������T...\n");
     InitTree_P(&PT);
     CreateTree_P(&PT, "TestData.txt");
-    PrintGraph_P(PT);
+    PrintTree_P(PT);
     printf("\n");
     
     printf("����˫�ױ�ʾ��תΪ���ĺ���-�ֵܱ�ʾ����\n");
     CST = Algo_6_66(PT);
-    PrintGraph_CS(CST);
+    PrintTree_CS(CST);
     printf("\n");
     
     return 0;
diff --git a/VisualC++/ExerciseBook/06.66/CSTree.c b/VisualC++/ExerciseBook/06.66/CSTree.c
index a121656..819aa17 100644
--- a/VisualC++/ExerciseBook/06.66/CSTree.c
+++ b/VisualC++/ExerciseBook/06.66/CSTree.c
@@ -29,7 +29,7 @@ Status TreeEmpty_CS(CSTree T) {
 }
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph_CS(CSTree T) {
+void PrintTree_CS(CSTree T) {
     
     // ���������������������
     if(TreeEmpty_CS(T)) {
diff --git a/VisualC++/ExerciseBook/06.66/CSTree.h b/VisualC++/ExerciseBook/06.66/CSTree.h
index 2899652..7c80158 100644
--- a/VisualC++/ExerciseBook/06.66/CSTree.h
+++ b/VisualC++/ExerciseBook/06.66/CSTree.h
@@ -42,7 +42,7 @@ Status InitTree_CS(CSTree* T);
 Status TreeEmpty_CS(CSTree T);
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph_CS(CSTree T);
+void PrintTree_CS(CSTree T);
 
 // ͼ�λ������ǰ�ṹ�ڲ�ʵ��
 static void Print_CS(CSTree T, int row);
diff --git a/VisualC++/ExerciseBook/06.66/PTree.c b/VisualC++/ExerciseBook/06.66/PTree.c
index 9ea6921..44e80ec 100644
--- a/VisualC++/ExerciseBook/06.66/PTree.c
+++ b/VisualC++/ExerciseBook/06.66/PTree.c
@@ -246,7 +246,7 @@ static void getPos_P(PTree T, Pos pt[]) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph_P(PTree T) {
+void PrintTree_P(PTree T) {
     Pos pt[MAX_TREE_SIZE];
     
     // ���������������������
diff --git a/VisualC++/ExerciseBook/06.66/PTree.h b/VisualC++/ExerciseBook/06.66/PTree.h
index 9bf3676..34305c7 100644
--- a/VisualC++/ExerciseBook/06.66/PTree.h
+++ b/VisualC++/ExerciseBook/06.66/PTree.h
@@ -99,7 +99,7 @@ static void getPos_P(PTree T, Pos pt[]);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph_P(PTree T);
+void PrintTree_P(PTree T);
 
 // ͼ�λ������ǰ�ṹ�ڲ�ʵ��
 static void Print_P(PTree T, Pos pt[], int i);
diff --git a/VisualC++/ExerciseBook/06.67/06.67.c b/VisualC++/ExerciseBook/06.67/06.67.c
index e971e1c..2ebefa2 100644
--- a/VisualC++/ExerciseBook/06.67/06.67.c
+++ b/VisualC++/ExerciseBook/06.67/06.67.c
@@ -21,7 +21,7 @@ int main(int argc, char* argv[]) {
     fclose(fp);
     printf("\n");
     
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     return 0;
diff --git a/VisualC++/ExerciseBook/06.67/CSTree.c b/VisualC++/ExerciseBook/06.67/CSTree.c
index 323fd9b..88c2c59 100644
--- a/VisualC++/ExerciseBook/06.67/CSTree.c
+++ b/VisualC++/ExerciseBook/06.67/CSTree.c
@@ -29,7 +29,7 @@ Status TreeEmpty(CSTree T) {
 }
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CSTree T) {
+void PrintTree(CSTree T) {
     
     // ���������������������
     if(TreeEmpty(T)) {
diff --git a/VisualC++/ExerciseBook/06.67/CSTree.h b/VisualC++/ExerciseBook/06.67/CSTree.h
index 8c3b490..95ebcd2 100644
--- a/VisualC++/ExerciseBook/06.67/CSTree.h
+++ b/VisualC++/ExerciseBook/06.67/CSTree.h
@@ -42,7 +42,7 @@ Status InitTree(CSTree* T);
 Status TreeEmpty(CSTree T);
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CSTree T);
+void PrintTree(CSTree T);
 
 // ͼ�λ������ǰ�ṹ�ڲ�ʵ��
 static void Print(CSTree T, int row);
diff --git a/VisualC++/ExerciseBook/06.68/06.68.c b/VisualC++/ExerciseBook/06.68/06.68.c
index 116a90b..8fbfd1c 100644
--- a/VisualC++/ExerciseBook/06.68/06.68.c
+++ b/VisualC++/ExerciseBook/06.68/06.68.c
@@ -21,7 +21,7 @@ int main(int argc, char* argv[]) {
     fclose(fp);
     printf("\n");
     
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     return 0;
diff --git a/VisualC++/ExerciseBook/06.68/CSTree.c b/VisualC++/ExerciseBook/06.68/CSTree.c
index 323fd9b..88c2c59 100644
--- a/VisualC++/ExerciseBook/06.68/CSTree.c
+++ b/VisualC++/ExerciseBook/06.68/CSTree.c
@@ -29,7 +29,7 @@ Status TreeEmpty(CSTree T) {
 }
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CSTree T) {
+void PrintTree(CSTree T) {
     
     // ���������������������
     if(TreeEmpty(T)) {
diff --git a/VisualC++/ExerciseBook/06.68/CSTree.h b/VisualC++/ExerciseBook/06.68/CSTree.h
index 8c3b490..95ebcd2 100644
--- a/VisualC++/ExerciseBook/06.68/CSTree.h
+++ b/VisualC++/ExerciseBook/06.68/CSTree.h
@@ -42,7 +42,7 @@ Status InitTree(CSTree* T);
 Status TreeEmpty(CSTree T);
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CSTree T);
+void PrintTree(CSTree T);
 
 // ͼ�λ������ǰ�ṹ�ڲ�ʵ��
 static void Print(CSTree T, int row);
diff --git a/VisualC++/ExerciseBook/06.69/06.69.c b/VisualC++/ExerciseBook/06.69/06.69.c
index 856bd29..b240700 100644
--- a/VisualC++/ExerciseBook/06.69/06.69.c
+++ b/VisualC++/ExerciseBook/06.69/06.69.c
@@ -14,7 +14,7 @@ int main(int argc, char* argv[]) {
     printf("��������������������T...\n");
     InitBiTree(&T);
     CreateBiTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("�����������Ұ������ӡ����\n");
diff --git a/VisualC++/ExerciseBook/06.69/BiTree.c b/VisualC++/ExerciseBook/06.69/BiTree.c
index 3491ed2..7ab7f01 100644
--- a/VisualC++/ExerciseBook/06.69/BiTree.c
+++ b/VisualC++/ExerciseBook/06.69/BiTree.c
@@ -149,7 +149,7 @@ static void CreateTree(BiTree* T, FILE* fp) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/VisualC++/ExerciseBook/06.69/BiTree.h b/VisualC++/ExerciseBook/06.69/BiTree.h
index 425dfa1..e3fb736 100644
--- a/VisualC++/ExerciseBook/06.69/BiTree.h
+++ b/VisualC++/ExerciseBook/06.69/BiTree.h
@@ -87,6 +87,6 @@ static void CreateTree(BiTree* T, FILE* fp);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/VisualC++/ExerciseBook/06.70/06.70.c b/VisualC++/ExerciseBook/06.70/06.70.c
index 8eb0c29..8718dee 100644
--- a/VisualC++/ExerciseBook/06.70/06.70.c
+++ b/VisualC++/ExerciseBook/06.70/06.70.c
@@ -17,7 +17,7 @@ int main(int argc, char* argv[]) {
     fp = fopen("TestData.txt", "r");
     Algo_6_70(&T, fp);
     fclose(fp);
-    PrintGraph(T);
+    PrintTree(T);
     
     return 0;
 }
diff --git a/VisualC++/ExerciseBook/06.70/BiTree.c b/VisualC++/ExerciseBook/06.70/BiTree.c
index 76327ed..f772f85 100644
--- a/VisualC++/ExerciseBook/06.70/BiTree.c
+++ b/VisualC++/ExerciseBook/06.70/BiTree.c
@@ -50,7 +50,7 @@ int BiTreeDepth(BiTree T) {
 }
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T) {
+void PrintTree(BiTree T) {
     int level, width;
     int i, j, k, w;
     int begin;
diff --git a/VisualC++/ExerciseBook/06.70/BiTree.h b/VisualC++/ExerciseBook/06.70/BiTree.h
index d53885f..3ab5bf3 100644
--- a/VisualC++/ExerciseBook/06.70/BiTree.h
+++ b/VisualC++/ExerciseBook/06.70/BiTree.h
@@ -49,6 +49,6 @@ Status BiTreeEmpty(BiTree T);
 int BiTreeDepth(BiTree T);
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ�������ڲ�����ʹ��
-void PrintGraph(BiTree T);
+void PrintTree(BiTree T);
 
 #endif
diff --git a/VisualC++/ExerciseBook/06.71/06.71.c b/VisualC++/ExerciseBook/06.71/06.71.c
index 4ca6545..35581c7 100644
--- a/VisualC++/ExerciseBook/06.71/06.71.c
+++ b/VisualC++/ExerciseBook/06.71/06.71.c
@@ -21,7 +21,7 @@ int main(int argc, char* argv[]) {
     printf("����������������T...\n");
     InitTree(&T);
     CreateTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("���� 1������������������ӡ����\n");
diff --git a/VisualC++/ExerciseBook/06.71/CSTree.c b/VisualC++/ExerciseBook/06.71/CSTree.c
index 64d258f..387a571 100644
--- a/VisualC++/ExerciseBook/06.71/CSTree.c
+++ b/VisualC++/ExerciseBook/06.71/CSTree.c
@@ -128,7 +128,7 @@ static void Depth(CSTree T, int d, int* max) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CSTree T) {
+void PrintTree(CSTree T) {
     
     // ���������������������
     if(TreeEmpty(T)) {
diff --git a/VisualC++/ExerciseBook/06.71/CSTree.h b/VisualC++/ExerciseBook/06.71/CSTree.h
index 3d95beb..1bd284a 100644
--- a/VisualC++/ExerciseBook/06.71/CSTree.h
+++ b/VisualC++/ExerciseBook/06.71/CSTree.h
@@ -79,7 +79,7 @@ static void Depth(CSTree T, int d, int *max);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CSTree T);
+void PrintTree(CSTree T);
 
 // ͼ�λ������ǰ�ṹ�ڲ�ʵ��
 static void Print(CSTree T, int row);
diff --git a/VisualC++/ExerciseBook/06.72/06.72.c b/VisualC++/ExerciseBook/06.72/06.72.c
index 6933c36..5b54ab2 100644
--- a/VisualC++/ExerciseBook/06.72/06.72.c
+++ b/VisualC++/ExerciseBook/06.72/06.72.c
@@ -21,7 +21,7 @@ int main(int argc, char* argv[]) {
     printf("������T...\n");
     InitTree(&T);
     CreateTree(&T, "TestData.txt");
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("����������������ӡ����\n");
diff --git a/VisualC++/ExerciseBook/06.72/CTree.c b/VisualC++/ExerciseBook/06.72/CTree.c
index d2c194a..4874394 100644
--- a/VisualC++/ExerciseBook/06.72/CTree.c
+++ b/VisualC++/ExerciseBook/06.72/CTree.c
@@ -313,7 +313,7 @@ static void getPos(CTree T, Pos pt[]) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CTree T) {
+void PrintTree(CTree T) {
     Pos pt[MAX_TREE_SIZE];
     
     // ���������������������
diff --git a/VisualC++/ExerciseBook/06.72/CTree.h b/VisualC++/ExerciseBook/06.72/CTree.h
index 873504b..2fdd34b 100644
--- a/VisualC++/ExerciseBook/06.72/CTree.h
+++ b/VisualC++/ExerciseBook/06.72/CTree.h
@@ -118,7 +118,7 @@ static void getPos(CTree T, Pos pt[]);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CTree T);
+void PrintTree(CTree T);
 
 // ͼ�λ������ǰ�ṹ�ڲ�ʵ��
 static void Print(CTree T, Pos pt[], int i);
diff --git a/VisualC++/ExerciseBook/06.73-06.74/06.73-06.74.c b/VisualC++/ExerciseBook/06.73-06.74/06.73-06.74.c
index 49f6c9d..02204fc 100644
--- a/VisualC++/ExerciseBook/06.73-06.74/06.73-06.74.c
+++ b/VisualC++/ExerciseBook/06.73-06.74/06.73-06.74.c
@@ -23,7 +23,7 @@ int main(int argc, char* argv[]) {
     fp = fopen("TestData.txt", "r");
     Algo_6_73(&T, fp);
     fclose(fp);
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("������ �� 6.74 ��֤... ������\n");
diff --git a/VisualC++/ExerciseBook/06.73-06.74/CSTree.c b/VisualC++/ExerciseBook/06.73-06.74/CSTree.c
index 323fd9b..88c2c59 100644
--- a/VisualC++/ExerciseBook/06.73-06.74/CSTree.c
+++ b/VisualC++/ExerciseBook/06.73-06.74/CSTree.c
@@ -29,7 +29,7 @@ Status TreeEmpty(CSTree T) {
 }
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CSTree T) {
+void PrintTree(CSTree T) {
     
     // ���������������������
     if(TreeEmpty(T)) {
diff --git a/VisualC++/ExerciseBook/06.73-06.74/CSTree.h b/VisualC++/ExerciseBook/06.73-06.74/CSTree.h
index 8c3b490..95ebcd2 100644
--- a/VisualC++/ExerciseBook/06.73-06.74/CSTree.h
+++ b/VisualC++/ExerciseBook/06.73-06.74/CSTree.h
@@ -42,7 +42,7 @@ Status InitTree(CSTree* T);
 Status TreeEmpty(CSTree T);
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CSTree T);
+void PrintTree(CSTree T);
 
 // ͼ�λ������ǰ�ṹ�ڲ�ʵ��
 static void Print(CSTree T, int row);
diff --git a/VisualC++/ExerciseBook/06.75-06.76/06.75-06.76.c b/VisualC++/ExerciseBook/06.75-06.76/06.75-06.76.c
index a67f7f2..48f539b 100644
--- a/VisualC++/ExerciseBook/06.75-06.76/06.75-06.76.c
+++ b/VisualC++/ExerciseBook/06.75-06.76/06.75-06.76.c
@@ -26,7 +26,7 @@ int main(int argc, char* argv[]) {
     fp = fopen("TestData.txt", "r");
     Algo_6_75(&T, fp);
     fclose(fp);
-    PrintGraph(T);
+    PrintTree(T);
     printf("\n");
     
     printf("�� 6.76 ��֤...\n");
diff --git a/VisualC++/ExerciseBook/06.75-06.76/CTree.c b/VisualC++/ExerciseBook/06.75-06.76/CTree.c
index ba0d57d..c69501d 100644
--- a/VisualC++/ExerciseBook/06.75-06.76/CTree.c
+++ b/VisualC++/ExerciseBook/06.75-06.76/CTree.c
@@ -131,7 +131,7 @@ static void getPos(CTree T, Pos pt[]) {
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CTree T) {
+void PrintTree(CTree T) {
     Pos pt[MAX_TREE_SIZE];
     
     // ���������������������
diff --git a/VisualC++/ExerciseBook/06.75-06.76/CTree.h b/VisualC++/ExerciseBook/06.75-06.76/CTree.h
index 2647e1b..11f68b7 100644
--- a/VisualC++/ExerciseBook/06.75-06.76/CTree.h
+++ b/VisualC++/ExerciseBook/06.75-06.76/CTree.h
@@ -97,7 +97,7 @@ static void getPos(CTree T, Pos pt[]);
 /*�������������������������������������������� ͼ�λ���� ��������������������������������������������*/
 
 // ��ͼ�λ���ʽ�����ǰ�ṹ
-void PrintGraph(CTree T);
+void PrintTree(CTree T);
 
 // ͼ�λ������ǰ�ṹ�ڲ�ʵ��
 static void Print(CTree T, Pos pt[], int i);
diff --git a/VisualC++/ExerciseBook/ExerciseBook.sdf b/VisualC++/ExerciseBook/ExerciseBook.sdf
index c501911..219c0de 100644
Binary files a/VisualC++/ExerciseBook/ExerciseBook.sdf and b/VisualC++/ExerciseBook/ExerciseBook.sdf differ
diff --git a/VisualC++/ExerciseBook/ExerciseBook.suo b/VisualC++/ExerciseBook/ExerciseBook.suo
index 99e18d7..8f1085f 100644
Binary files a/VisualC++/ExerciseBook/ExerciseBook.suo and b/VisualC++/ExerciseBook/ExerciseBook.suo differ
diff --git a/VisualC++/Status/Status.c b/VisualC++/Status/Status.c
index 085e030..4d182b3 100644
--- a/VisualC++/Status/Status.c
+++ b/VisualC++/Status/Status.c
@@ -162,3 +162,19 @@ void Wait(long time) {
         // ��ѭ��
     }
 }
+
+// ��������˵��зָ������'\r'��'\n'��'\r\n'
+void skipLineSeparator(FILE* fp) {
+    int ch;
+    
+    if(fp == NULL) {
+        return;
+    }
+    
+    while((ch = getc(fp)) != EOF) {
+        if(ch >= 0 && ch <= 127 && ch != '\r' && ch != '\n') {
+            ungetc(ch, fp);
+            break;
+        }
+    }
+}
diff --git a/VisualC++/Status/Status.h b/VisualC++/Status/Status.h
index b81e11c..d578daf 100644
--- a/VisualC++/Status/Status.h
+++ b/VisualC++/Status/Status.h
@@ -30,6 +30,9 @@
 /* ״̬������ */
 typedef int Status;
 
+/* �������� */
+typedef int Boolean;
+
 
 // ��ȡ����
 int ReadData(FILE* fp, char* format, ...);
@@ -40,4 +43,7 @@ void PressEnterToContinue();
 // ������ͣһ��ʱ�䣬time�����������ʱ��
 void Wait(long time);
 
+// ��������˵��зָ������'\r'��'\n'��'\r\n'
+void skipLineSeparator(FILE* fp);
+
 #endif
diff --git a/VisualC++/Status/Status.lib b/VisualC++/Status/Status.lib
index f24c6ff..0669bee 100644
Binary files a/VisualC++/Status/Status.lib and b/VisualC++/Status/Status.lib differ
diff --git a/VisualC++/Status/Status.sdf b/VisualC++/Status/Status.sdf
index 506400c..3116cfc 100644
Binary files a/VisualC++/Status/Status.sdf and b/VisualC++/Status/Status.sdf differ
diff --git a/VisualC++/Status/Status.suo b/VisualC++/Status/Status.suo
index 2d410dc..a090b7a 100644
Binary files a/VisualC++/Status/Status.suo and b/VisualC++/Status/Status.suo differ