diff --git a/datastructure/2025301205+施光甲+实验七.cpp b/datastructure/2025301205+施光甲+实验七.cpp
new file mode 100644
index 0000000..3975965
--- /dev/null
+++ b/datastructure/2025301205+施光甲+实验七.cpp
@@ -0,0 +1,126 @@
+#include<stdio.h>
+
+int inf = 1000;
+
+typedef  struct{  
+   int weight;                    //½áµãȨֵ
+   int parent,lchild,rchild;     //½áµãµÄË«Çס¢×óº¢×Ó¡¢ÓÒº¢×ÓµÄϱê
+   char ch;                     //×Ö·û
+}HTNode,*HuffmanTree;
+
+//²éÕÒ
+int Find(HuffmanTree HT, int n)
+{
+int min = 0;
+for (int i = 1; i <= n; i++)
+{
+if (HT[i].weight<HT[min].weight && HT[i].parent == 0)
+min = i;
+}
+return min;
+}
+
+//Ñ¡Ôñ
+void select(HuffmanTree HT, int n, int &s1, int &s2)  //´«Èë²ÎÊýn=k-1 
+{
+s1 = Find(HT, n);   //a¡¢ÔÚHT[k](1¡Ük¡Üi-1)ÖÐÑ¡ÔñÁ½¸öÆäË«Ç×ÓòΪ0£¬ ÇÒȨֵ×îСµÄ½áµã£¬²¢·µ»ØËüÃÇÔÚHTÖеÄÐòºÅs1ºÍs2
+HT[s1].parent = n + 1;  //b¡¢µÃµ½Ð½áµãn + 1£¬´ÓÉ­ÁÖÖÐɾ³ýs1,s2£¬½«s1,s2µÄË«Ç×ÓòÓÉ0¸ÄΪk (¼´n+1)
+s2 = Find(HT, n);
+HT[s2].parent = n + 1;  //b¡¢µÃµ½Ð½áµãn + 1£¬´ÓÉ­ÁÖÖÐɾ³ýs1,s2£¬½«s1,s2µÄË«Ç×ÓòÓÉ0¸ÄΪk (¼´n+1)
+} 
+
+//¹¹Ôì
+void CreatHuffmanTree (HuffmanTree &HT, int weight[], char c[], int n)  //char c[100];  ×Öĸ
+{
+if(n<=1) return;
+int m = 2 * n - 1;   //Êý×é´æ´¢2n-1¸öÔªËØ
+HT=new HTNode[m+1];  //0ºÅµ¥ÔªÎ´Óã¬ËùÒÔÐèÒª¿ª±Ùm+1¸öµ¥Ôª£¬HT[m]±íʾ¸ù½áµã   
+for (int i = 1; i <= m; ++i)   //½«2n-1¸öÔªËصÄlch¡¢ rch¡¢ parent³õʼ»¯Îª0, ch×Ö·ûÈ«²¿³õʼ»¯Îª# 
+{
+//todo list ´¦Àíparent ¡¢lchild ¡¢rchild 
+HT[i].parent = 0;
+HT[i].lchild = 0;
+HT[i].rchild = 0;
+HT[i].ch = '#';
+}
+HT[0].weight = inf;   //int inf = 1000;
+
+for (int j = 1; j <= n; ++j)    
+{
+//todo list   //»ñÈ¡ Ç°n¸öµ¥ÔªÖÐÒ¶×Ó½ÚµãµÄ weightÖµ
+HT[j].weight = weight[j];
+HT[j].ch = c[j];   //»ñÈ¡ Ç°n¸öµ¥ÔªÖÐÒ¶×Ó½ÚµãµÄ ×Ö·û 
+}
+for (int k = n + 1; k <= m; ++k)   //ºÏ²¢²úÉún-1¸ö½áµã¡ª¡ª¹¹ÔìHuffmanÊ÷
+{
+int s1, s2;
+select(HT, k - 1, s1, s2);    //Ñ¡ÔñÁ½¸öÐèÒªÇóºÍµÄϱê
+//todo list         //c¡¢s1,s2·Ö±ð×÷ΪkµÄ×óÓÒº¢×Ó
+HT[k].lchild = s1;
+HT[k].rchild = s2;
+//todo list         //c¡¢k µÄȨֵΪ×óÓÒº¢×ÓȨֵ֮ºÍ
+HT[k].weight = HT[s1].weight + HT[s2].weight;
+}
+}
+
+//Êä³ö¹þ·òÂüÊ÷
+void DisplayHF(HuffmanTree HT, int r)
+{
+printf("%c %d\n",HT[r].ch,HT[r].weight);
+
+int s1 = HT[r].lchild;
+int s2 = HT[r].rchild;
+if (s1 != 0)
+DisplayHF(HT, s1);
+if (s2 != 0)
+DisplayHF(HT, s2);
+}
+
+//Êä³ö¹þ·òÂü±àÂë
+void DisplayHFCode(HuffmanTree HT, int r,int arr[], int top)
+{
+int s1 = HT[r].lchild;   // »ñÈ¡µ±Ç°½ÚµãµÄ×óº¢×ÓË÷Òý¸³Öµ¸øs1
+int s2 = HT[r].rchild;  // »ñÈ¡µ±Ç°½ÚµãµÄÓÒº¢×ÓË÷Òý¸³Öµ¸øs2
+
+    if (HT[r].lchild != 0) {  //×óº¢×Ó´æÔÚ 
+        arr[top] = 0;  // ÔÚ·¾¶Êý×éarrµÄµ±Ç°Î»ÖÃtop´æÈë0£¬±íʾ×ßÏò×óº¢×Ó
+        DisplayHFCode(HT, s1, arr, top + 1);  // µÝ¹éµ÷ÓÃDisplayHFCodeº¯Êý£¬´¦Àí×óº¢×ӽڵ㣬ͬʱtop¼Ó1
+    }
+    if (HT[r].rchild != 0) { //ÓÒº¢×Ó´æÔÚ
+        arr[top] = 1;  // ÔÚ·¾¶Êý×éarrµÄµ±Ç°Î»ÖÃtop´æÈë1£¬±íʾ×ßÏòÓÒº¢×Ó
+        DisplayHFCode(HT, s2, arr, top + 1);  // µÝ¹éµ÷ÓÃDisplayHFCodeº¯Êý£¬´¦ÀíÓÒº¢×ӽڵ㣬ͬʱtop¼Ó1
+    }
+    if (HT[r].lchild==0 && HT[r].rchild==0) {  //Ò¶×Ó½Úµã 
+        printf("×Ö·û %c µÄ±àÂë: ", HT[r].ch);  // ´òÓ¡µ±Ç°Ò¶×Ó½Úµã¶ÔÓ¦µÄ×Ö·û
+        for (int i = 0; i < top; ++i) {        // ±éÀú·¾¶Êý×éarr£¬´Ó0µ½top-1
+            printf("%d", arr[i]);             // ´òӡ·¾¶Êý×éÖеÄÿ¸öÔªËØ£¬¼´×Ö·ûµÄ¹þ·òÂü±àÂë
+        }
+        printf("\n");
+    }
+}
+
+int main()
+{
+HuffmanTree HT;
+int  a[100];  //Ȩֵ
+char c[100];  //×Öĸ
+int arr[100];  //arr:ÓÃÓÚ´æ´¢´Ó¸ù½áµãµ½µ±Ç°½áµãµÄ·¾¶ÉϵÄ0ºÍ1µÄÊý×é
+int top = 0;  //top: arrÊý×éµÄµ±Ç°Ë÷Òý£¬±íʾÒѾ­´æ´¢µ½µÄ·¾¶µÄ³¤¶È
+
+printf("ÇëÊäÈëÆß×éÊý¾Ý!(×Öĸ Ȩֵ)\n");
+for (int i = 1; i <= 7; i++) {
+scanf("%c %d",&c[i],&a[i]);
+getchar();
+}
+CreatHuffmanTree (HT, a, c, 7);
+printf("¹þ·òÂüÊ÷ÏÈÐò±éÀúÐòÁÐΪ£¨×Öĸ Ȩֵ£©£º\n");
+printf("ÐÂÉú³É½áµãÓá®#¡¯±ê¼Ç\n");
+DisplayHF(HT, 7 * 2 - 1);
+
+printf("¹þ·òÂü±àÂëΪ£º\n");
+DisplayHFCode(HT,7 * 2 - 1, arr, top);
+
+// ÊͷŶ¯Ì¬·ÖÅäµÄÄڴ棨²¹³äÄÚ´æÊÍ·Å£¬±ÜÃâÄÚ´æй©£¬²»Ó°ÏìÔ­ÓÐÂß¼­£©
+delete[] HT;
+return 0;
+}
diff --git a/datastructure/2025301205+施光甲+实验六.cpp b/datastructure/2025301205+施光甲+实验六.cpp
index 9e7221c..4a4ab14 100644
--- a/datastructure/2025301205+施光甲+实验六.cpp
+++ b/datastructure/2025301205+施光甲+实验六.cpp
@@ -1,198 +1,304 @@
 #include <stdio.h>
 #include <stdlib.h>
 #define OK 1
-typedef int Status;	
+typedef int Status;
 typedef struct BiTNode
 {
-	char data;   //½áµãÊý¾ÝÓò 
-	struct BiTNode *lchild, *rchild;  //×óÓÒº¢×ÓÖ¸Õë 
-}BiTNode,*BiTree;
+    char data;                       // ½áµãÊý¾ÝÓò
+    struct BiTNode *lchild, *rchild; // ×óÓÒº¢×ÓÖ¸Õë
+} BiTNode, *BiTree;
 
-//1¡¢´´½¨¶þ²æÁ´±í£º°´ÏÈÐò´ÎÐòÊäÈë¶þ²æÊ÷ÖнáµãµÄÖµ£¬´´½¨¶þ²æÁ´±í±íʾµÄ¶þ²æÊ÷T 
-// Àý£º½¨Á¢¿Î±¾P115ͼ5.10(b)µÄ¶þ²æÊ÷--¶ÁÈë×Ö·ûµÄ˳ÐòΪ£ºABC##DE#G##F###(#±íʾ¿ÕÊ÷) 
+// 1¡¢´´½¨¶þ²æÁ´±í£º°´ÏÈÐò´ÎÐòÊäÈë¶þ²æÊ÷ÖнáµãµÄÖµ£¬´´½¨¶þ²æÁ´±í±íʾµÄ¶þ²æÊ÷T
+//  Àý£º½¨Á¢¿Î±¾P115ͼ5.10(b)µÄ¶þ²æÊ÷¡ª¡ª¶ÁÈë×Ö·ûµÄ˳ÐòΪ£ºABC##DE#G##F###(#±íʾ¿ÕÊ÷)
 BiTree Create(BiTree &T)
 {
-	char ch;
-	printf("ÇëÊäÈëÒ»¸ö×Ö·û:");
-	scanf("%c",&ch);
-	getchar();  //Çå¿Õ»º³åÇø£¬°ÑÒÅÁôµÄ\nÇå³ý 
-	//todo list   //if: Èç¹ûÊäÈëµÄÊÇ'#'£¬Ôò½¨Á¢Ò»¿Ã¿ÕÊ÷
-	//else£º·ñÔò£¬µÝ¹é½¨Á¢Ò»¸ö¶þ²æÊ÷£¨×¢Ò⣺ÊÇ°´°´ÏÈÐò´ÎÐò´´½¨µÄ¶þ²æÊ÷£©
-	if(ch == '#') {
-		T = NULL;  //½¨Á¢¿ÕÊ÷
-	} else {
-		T = (BiTree)malloc(sizeof(BiTNode));  //´´½¨Ð½áµã
-		T->data = ch;
-		T->lchild = NULL;
-		T->rchild = NULL;
-		T->lchild = Create(T->lchild);  //µÝ¹é´´½¨×ó×ÓÊ÷
-		T->rchild = Create(T->rchild);  //µÝ¹é´´½¨ÓÒ×ÓÊ÷
-	}
-	return T;
+    char ch;
+    printf("ÇëÊäÈëÒ»¸ö×Ö·û:");
+    scanf("%c", &ch);
+    getchar(); // Çå¿Õ»º³åÇø£¬°ÑÒÅÁôµÄ\nÇå³ý
+
+    // todo list   //if: Èç¹ûÊäÈëµÄÊÇ¡¯#¡¯£¬Ôò½¨Á¢Ò»¿Ã¿ÕÊ÷
+    if (ch == '#')
+    {
+        T = NULL;
+    }
+    // else£º·ñÔò£¬µÝ¹é½¨Á¢Ò»¸ö¶þ²æÊ÷£¨×¢Ò⣺ÊÇ°´°´ÏÈÐò´ÎÐò´´½¨µÄ¶þ²æÊ÷£©
+    else
+    {
+        T = (BiTree)malloc(sizeof(BiTNode));
+        T->data = ch;
+        Create(T->lchild);
+        Create(T->rchild);
+    }
+    return T;
 }
 
-//ÏÈÐò±éÀú¶þ²æÊ÷
-Status  PreOrder(BiTree &T)
+// ÏÈÐò±éÀú¶þ²æÊ÷
+Status PreOrder(BiTree &T)
 {
-	//todo list   //if: Èç¹ûÊÇ¿ÕÊ÷£¬Ôò·µ»Ø
-	//else:·ñÔò£¬ÏÈ·ÃÎʸù½áµã (D)
-	//Ç°Ðò±éÀú×ó×ÓÊ÷ (L)
-	//Ç°Ðò±éÀúÓÒ×ÓÊ÷ (R)
-	if(T == NULL) {
-		return OK;
-	} else {
-		printf("%c ", T->data);  //·ÃÎʸù½áµã
-		PreOrder(T->lchild);     //Ç°Ðò±éÀú×ó×ÓÊ÷
-		PreOrder(T->rchild);     //Ç°Ðò±éÀúÓÒ×ÓÊ÷
-	}
-	return OK;
+    // todo list   //if: Èç¹ûÊÇ¿ÕÊ÷£¬Ôò·µ»Ø
+    if (T == NULL)
+    {
+        return OK;
+    }
+    // else:·ñÔò£¬ÏÈ·ÃÎʸù½áµã (D)
+    else
+    {
+        printf("%c ", T->data);
+        // Ç°Ðò±éÀú×ó×ÓÊ÷ (L)
+        PreOrder(T->lchild);
+        // Ç°Ðò±éÀúÓÒ×ÓÊ÷ (R)
+        PreOrder(T->rchild);
+    }
+    return OK;
 }
 
-//ÖÐÐò±éÀú¶þ²æÊ÷ 
+// ÖÐÐò±éÀú¶þ²æÊ÷
 Status InOrder(BiTree &T)
 {
-	//todo list   //if: Èç¹ûÊÇ¿ÕÊ÷£¬Ôò·µ»Ø
-	//else:·ñÔò£¬ÏÈÖÐÐò±éÀú×ó×ÓÊ÷ (L)
-	//·ÃÎʸù½áµã (D)
-	//ÖÐÐò±éÀúÓÒ×ÓÊ÷ (R)
-	if(T == NULL) {
-		return OK;
-	} else {
-		InOrder(T->lchild);      //ÖÐÐò±éÀú×ó×ÓÊ÷
-		printf("%c ", T->data);  //·ÃÎʸù½áµã
-		InOrder(T->rchild);      //ÖÐÐò±éÀúÓÒ×ÓÊ÷
-	}
-	return OK;
+    // todo list   //if: Èç¹ûÊÇ¿ÕÊ÷£¬Ôò·µ»Ø
+    if (T == NULL)
+    {
+        return OK;
+    }
+    // else:·ñÔò£¬ÏÈÖÐÐò±éÀú×ó×ÓÊ÷ (L)
+    else
+    {
+        InOrder(T->lchild);
+        // ·ÃÎʸù½áµã (D)
+        printf("%c ", T->data);
+        // ÖÐÐò±éÀúÓÒ×ÓÊ÷ (R)
+        InOrder(T->rchild);
+    }
+    return OK;
 }
 
-//ºóÐò±éÀú
+// ºóÐò±éÀú
 Status PostOrder(BiTree &T)
 {
-	//todo list   //if: Èç¹ûÊÇ¿ÕÊ÷£¬Ôò·µ»Ø
-	//else:·ñÔò£¬ÏȺóÐò±éÀú×ó×ÓÊ÷ (L)
-	//ºóÐò±éÀúÓÒ×ÓÊ÷ (R)
-	//·ÃÎʸù½áµã (D)
-	if(T == NULL) {
-		return OK;
-	} else {
-		PostOrder(T->lchild);    //ºóÐò±éÀú×ó×ÓÊ÷
-		PostOrder(T->rchild);    //ºóÐò±éÀúÓÒ×ÓÊ÷
-		printf("%c ", T->data);  //·ÃÎʸù½áµã
-	}
-	return OK;
+    // todo list   //if: Èç¹ûÊÇ¿ÕÊ÷£¬Ôò·µ»Ø
+    if (T == NULL)
+    {
+        return OK;
+    }
+    // else:·ñÔò£¬ÏȺóÐò±éÀú×ó×ÓÊ÷ (L)
+    else
+    {
+        PostOrder(T->lchild);
+        // ºóÐò±éÀúÓÒ×ÓÊ÷ (R)
+        PostOrder(T->rchild);
+        // ·ÃÎʸù½áµã (D)
+        printf("%c ", T->data);
+    }
+    return OK;
 }
 
-//²ã´Î±éÀú1
+// ²ã´Î±éÀú1
 void LeverOrder(BiTree &T)
 {
-	if (T == NULL) {  // ´¦Àí¿ÕÊ÷£¬±ÜÃâ¿ÕÖ¸Õë·ÃÎÊ
+    if (T == NULL)
+    { // ´¦Àí¿ÕÊ÷£¬±ÜÃâ¿ÕÖ¸Õë·ÃÎÊ
         printf("¶þ²æÊ÷Ϊ¿Õ£¡\n");
         return;
     }
-	//BT *Queue[100]; //¶ÓÁÐ
-	BiTree Queue[100]; //¶ÓÁÐ
-	char ch;
-	int front = 0;
-	int rear = 0;
-	// ¶ÓÁб߽ç¼ì²é£¨ÐÂÔö£º·ÀÖ¹Êý×éÔ½½ç£©
-    if (rear >= 100) {
+    // BT *Queue[100]; //¶ÓÁÐ
+    BiTree Queue[100]; // ¶ÓÁÐ
+    char ch;
+    int front = 0;
+    int rear = 0;
+    // ¶ÓÁб߽ç¼ì²é£¨ÐÂÔö£º·ÀÖ¹Êý×éÔ½½ç£©
+    if (rear >= 100)
+    {
         printf("¶ÓÁÐÒÑÂú£¬ÎÞ·¨Èë¶Ó£¡\n");
         return;
     }
-	Queue[rear++] = T; //¸ù½ÚµãÈë¶Ó
-	while (front < rear) //µ±¶Ó²»¿Õ
-	{
-		ch = Queue[front]->data; //³ö¶Ó¶ÓÍ·ÔªËØ 
-		printf("%c ",ch);
-		if (Queue[front]->lchild){
-			if (rear >= 100) {
-            	printf("¶ÓÁÐÒÑÂú£¬×óº¢×ÓÎÞ·¨Èë¶Ó£¡\n");
+    Queue[rear++] = T;   // ¸ù½ÚµãÈë¶Ó
+    while (front < rear) // µ±¶Ó²»¿Õ
+    {
+        ch = Queue[front]->data; // ³ö¶Ó¶ÓÍ·ÔªËØ
+        printf("%c ", ch);
+        if (Queue[front]->lchild)
+        {
+            if (rear >= 100)
+            {
+                printf("¶ÓÁÐÒÑÂú£¬×óº¢×ÓÎÞ·¨Èë¶Ó£¡\n");
                 break;
             }
-			Queue[rear++] = Queue[front]->lchild;
-		}
-		if (Queue[front]->rchild){
-			if (rear >= 100) {
-	            printf("¶ÓÁÐÒÑÂú£¬ÓÒº¢×ÓÎÞ·¨Èë¶Ó£¡\n");
-	            break;
-	        }
-			Queue[rear++] = Queue[front]->rchild;
-		}
-		front++;  // ¶ÓÍ·ºóÒÆ£¬Íê³É³ö¶Ó
-	}
-	
+            Queue[rear++] = Queue[front]->lchild;
+        }
+        if (Queue[front]->rchild)
+        {
+            if (rear >= 100)
+            {
+                printf("¶ÓÁÐÒÑÂú£¬ÓÒº¢×ÓÎÞ·¨Èë¶Ó£¡\n");
+                break;
+            }
+            Queue[rear++] = Queue[front]->rchild;
+        }
+        front++; // ¶ÓÍ·ºóÒÆ£¬Íê³É³ö¶Ó
+    }
 }
 
-//½Úµã×ÜÊý
+/*
+
+// ------------- Ñ­»·¶ÓÁнṹÌ嶨Ò壨²ãÐò±éÀúÒÀÀµ¶ÓÁУ© -------------
+#define MAXQSIZE 100  // ¶ÓÁÐ×î´óÈÝÁ¿
+typedef struct {
+    BiTree base[MAXQSIZE];  // ¶ÓÁд洢¶þ²æÊ÷½áµãÖ¸Õë
+    int front;              // ¶ÓÍ·Ö¸Õë
+    int rear;               // ¶ÓβָÕë
+} SqQueue;
+
+// ³õʼ»¯¶ÓÁÐ
+int InitQueue(SqQueue *qu) {
+    qu->front = qu->rear = 0;  // ¿Õ¶ÓÁУº¶ÓÍ·=¶Óβ=0
+    return 1;
+}
+
+// Åж϶ÓÁÐÊÇ·ñΪ¿Õ
+int QueueEmpty(SqQueue *qu) {
+    return qu->front == qu->rear;
+}
+
+// Èë¶Ó²Ù×÷£¨½«¶þ²æÊ÷½áµãÖ¸ÕëÈë¶Ó£©
+int enQueue(SqQueue *qu, BiTree p) {
+    // Åж϶ÓÁÐÊÇ·ñÂú£¨Ñ­»·¶ÓÁÐÅÐÂúÌõ¼þ£©
+    if ((qu->rear + 1) % MAXQSIZE == qu->front) {
+        printf("¶ÓÁÐÂú£¬Èë¶Óʧ°Ü£¡\n");
+        return 0;
+    }
+    qu->base[qu->rear] = p;          // ½áµãÖ¸ÕëÈë¶Ó
+    qu->rear = (qu->rear + 1) % MAXQSIZE;  // ¶ÓβָÕëºóÒÆ
+    return 1;
+}
+
+// ³ö¶Ó²Ù×÷£¨È¡³ö¶ÓÍ·½áµãÖ¸Õ룩
+int deQueue(SqQueue *qu, BiTree *p) {
+    if (QueueEmpty(qu)) {  // ¶Ó¿ÕÔò³ö¶Óʧ°Ü
+        printf("¶ÓÁпգ¬³ö¶Óʧ°Ü£¡\n");
+        return 0;
+    }
+    *p = qu->base[qu->front];        // È¡³ö¶ÓÍ·ÔªËØ
+    qu->front = (qu->front + 1) % MAXQSIZE;  // ¶ÓÍ·Ö¸ÕëºóÒÆ
+    return 1;
+}
+
+// ------------- ²ã´Î±éÀú2 -------------
+void LevelOrder(BiTree b) {
+    BiTree p;
+    SqQueue qu;  // ¶¨Òå¶ÓÁУ¨×¢Ò⣺ԭ²Î¿¼ÖÐquÊÇÖ¸Õ룬´Ë´¦¸ÄΪֱ½Ó¶¨Òå½á¹¹Ì壬¸üÒ×Àí½â£©
+
+    if (b == NULL) return;  // ¿ÕÊ÷Ö±½Ó·µ»Ø
+
+    InitQueue(&qu);         // ³õʼ»¯¶ÓÁÐ
+    enQueue(&qu, b);        // ¸ù½áµãÈë¶Ó
+
+    while (!QueueEmpty(&qu)) {  // ¶ÓÁзǿÕÔòÑ­»·
+        deQueue(&qu, &p);       // ³ö¶Óµ±Ç°½áµã
+        printf("%c ", p->data); // ·ÃÎʵ±Ç°½áµã
+
+        // ×óº¢×Ó·Ç¿ÕÔòÈë¶Ó
+        if (p->lchild != NULL) {
+            enQueue(&qu, p->lchild);
+        }
+        // ÓÒº¢×Ó·Ç¿ÕÔòÈë¶Ó
+        if (p->rchild != NULL) {
+            enQueue(&qu, p->rchild);
+        }
+    }
+}
+*/
+
+// ½Úµã×ÜÊý
 int Count(BiTree &T)
 {
-	//todo list    //if£ºÈç¹ûÊÇ¿ÕÊ÷£¬Ôò½áµã¸öÊýΪ0£»
-	//else£º·ñÔò£¬½áµã¸öÊýΪ×ó×ÓÊ÷µÄ½áµã¸öÊý+ÓÒ×ÓÊ÷µÄ½áµã¸öÊýÔÙ+1¡£
-	if(T == NULL) {
-		return 0;
-	} else {
-		return Count(T->lchild) + Count(T->rchild) + 1;
-	}
+    // todo list    //if£ºÈç¹ûÊÇ¿ÕÊ÷£¬Ôò½áµã¸öÊýΪ0£»
+    if (T == NULL)
+    {
+        return 0;
+    }
+    // else£º·ñÔò£¬½áµã¸öÊýΪ×ó×ÓÊ÷µÄ½áµã¸öÊý+ÓÒ×ÓÊ÷µÄ½áµã¸öÊýÔÙ+1¡£
+    else
+    {
+        return Count(T->lchild) + Count(T->rchild) + 1;
+    }
 }
-//Ò¶×Ó½Úµã
+// Ò¶×Ó½Úµã
 int CountLeaf(BiTree &T)
 {
-	//todo list    //if£ºÈç¹ûÊÇ¿ÕÊ÷£¬ÔòÒ¶×Ó½áµã¸öÊýΪ0£»
-	//else if£ºÈç¹ûÊÇÒ¶×Ó½áµã£¬Ôò·µ»Ø1£»
-	//else·ñÔò£¬Îª×ó×ÓÊ÷µÄÒ¶×Ó½áµã¸öÊý+ÓÒ×ÓÊ÷µÄÒ¶×Ó½áµã¸öÊý¡£
-	if(T == NULL) {
-		return 0;
-	} else if(T->lchild == NULL && T->rchild == NULL) {
-		return 1;
-	} else {
-		return CountLeaf(T->lchild) + CountLeaf(T->rchild);
-	}
+    // todo list    //if£ºÈç¹ûÊÇ¿ÕÊ÷£¬ÔòÒ¶×Ó½áµã¸öÊýΪ0£»
+    if (T == NULL)
+    {
+        return 0;
+    }
+    // else if£ºÈç¹ûÊÇÒ¶×Ó½áµã£¬Ôò·µ»Ø1£»
+    else if (T->lchild == NULL && T->rchild == NULL)
+    {
+        return 1;
+    }
+    // else·ñÔò£¬Îª×ó×ÓÊ÷µÄÒ¶×Ó½áµã¸öÊý+ÓÒ×ÓÊ÷µÄÒ¶×Ó½áµã¸öÊý¡£
+    else
+    {
+        return CountLeaf(T->lchild) + CountLeaf(T->rchild);
+    }
 }
 int main()
 {
-	BiTree T = NULL;   //´´½¨Ò»¿Å¿ÕÊ÷
-	int choose = -1;
-	printf("*********************************************\n");
-	printf("**********           ʵÑéÁù           *******\n");
-	printf("*********************************************\n");
-	printf("**********     1.´´½¨Ò»¿Ã¶þ²æÊ÷       *******\n");
-	printf("**********     2.ÏÈÐò±éÀú¶þ²æÊ÷       *******\n");
-	printf("**********     3.ÖÐÐò±éÀú¶þ²æÊ÷       *******\n");
-	printf("**********     4.ºóÐò±éÀú¶þ²æÊ÷       *******\n");
-	printf("**********     5.²ãÐò±éÀú¶þ²æÊ÷       *******\n");
-	printf("**********     6.Çó¶þ²æÊ÷½Úµã¸öÊý     *******\n");
-	printf("**********     7.Çó¶þ²æÊýÒ¶×Ó½Úµã¸öÊý *******\n");
-	printf("**********     0.Í˳ö                 *******\n");
-	printf("*********************************************\n");
-	while (choose)
-	{
-		printf("\n");
-		printf("ÇëÊäÈëÄãµÄÑ¡ÔñÏ");
-		scanf("%d", &choose);
-		getchar(); //Çå¿Õ»º³åÇø£¬°ÑÒÅÁôµÄ\nÇå³ý 
-		switch (choose)
-		{
-		case 1:T = Create(T); break;  //´´½¨
-		printf("\n");
-		case 2:
-			printf("ÏÈÐòÐòÁÐΪ£º") ;
-			PreOrder(T); break;   //ÏÈÐò±éÀú¶þ²æÊ÷
-			printf("\n");
-		case 3:
-			printf("ÖÐÐòÐòÁÐΪ£º") ;
-			InOrder(T); break;   //ÖÐÐò±éÀú¶þ²æÊ÷
-			printf("\n");
-		case 4:
-			printf("ºóÐòÐòÁÐΪ£º") ;
-			PostOrder(T); break;  //ºóÐò±éÀú¶þ²æÊ÷
-			printf("\n");
-		case 5:
-			printf("²ã´ÎÐòÁÐΪ£º")	;		
-			LeverOrder(T); break;   //²ãÐò±éÀú¶þ²æÊ÷
-			printf("\n");
-		case 6:printf("½Úµã×ÜÊýΪ£º%d\n", Count(T)); break;//½áµã×ÜÊý
-		case 7:printf("Ò¶×Ó½Úµã×ÜÊýΪ£º%d\n", CountLeaf(T)); break; //Ò¶×Ó½áµã×ÜÊý
-		case 0:exit(0); break;
-		}
-	}
+    BiTree T = NULL; // ´´½¨Ò»¿Å¿ÕÊ÷
+    int choose = -1;
+    printf("*********************************************\n");
+    printf("**********           ʵÑéÁù           *******\n");
+    printf("*********************************************\n");
+    printf("**********     1.´´½¨Ò»¿Ã¶þ²æÊ÷       *******\n");
+    printf("**********     2.ÏÈÐò±éÀú¶þ²æÊ÷       *******\n");
+    printf("**********     3.ÖÐÐò±éÀú¶þ²æÊ÷       *******\n");
+    printf("**********     4.ºóÐò±éÀú¶þ²æÊ÷       *******\n");
+    printf("**********     5.²ãÐò±éÀú¶þ²æÊ÷       *******\n");
+    printf("**********     6.Çó¶þ²æÊ÷½Úµã¸öÊý     *******\n");
+    printf("**********     7.Çó¶þ²æÊýÒ¶×Ó½Úµã¸öÊý *******\n");
+    printf("**********     0.Í˳ö                 *******\n");
+    printf("*********************************************\n");
+    while (choose)
+    {
+        printf("\n");
+        printf("ÇëÊäÈëÄãµÄÑ¡ÔñÏ");
+        scanf("%d", &choose);
+        getchar(); // Çå¿Õ»º³åÇø£¬°ÑÒÅÁôµÄ\nÇå³ý
+        switch (choose)
+        {
+        case 1:
+            T = Create(T);
+            break; // ´´½¨
+            printf("\n");
+        case 2:
+            printf("ÏÈÐòÐòÁÐΪ£º");
+            PreOrder(T);
+            break; // ÏÈÐò±éÀú¶þ²æÊ÷
+            printf("\n");
+        case 3:
+            printf("ÖÐÐòÐòÁÐΪ£º");
+            InOrder(T);
+            break; // ÖÐÐò±éÀú¶þ²æÊ÷
+            printf("\n");
+        case 4:
+            printf("ºóÐòÐòÁÐΪ£º");
+            PostOrder(T);
+            break; // ºóÐò±éÀú¶þ²æÊ÷
+            printf("\n");
+        case 5:
+            printf("²ã´ÎÐòÁÐΪ£º");
+            LeverOrder(T);
+            break; // ²ãÐò±éÀú¶þ²æÊ÷
+            printf("\n");
+        case 6:
+            printf("½Úµã×ÜÊýΪ£º%d\n", Count(T));
+            break; // ½áµã×ÜÊý
+        case 7:
+            printf("Ò¶×Ó½Úµã×ÜÊýΪ£º%d\n", CountLeaf(T));
+            break; // Ò¶×Ó½áµã×ÜÊý
+        case 0:
+            exit(0);
+            break;
+        }
+    }
 }
diff --git a/datastructure/2025301205+施光甲+试验八.cpp b/datastructure/2025301205+施光甲+试验八.cpp
new file mode 100644
index 0000000..4643818
--- /dev/null
+++ b/datastructure/2025301205+施光甲+试验八.cpp
@@ -0,0 +1,180 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#define MaxSize 8
+
+typedef struct ArcNode {                    //¡¾±ß½áµã¡¿ 
+    int adjvex;                     //¸Ã±ßËùÖ¸ÏòµÄ¶¥µãµÄλÖÃ
+    struct ArcNode* nextarc;        //Ö¸ÏòÏÂÒ»Ìõ±ßµÄÖ¸Õë
+}ArcNode;
+
+typedef struct VNode {                    //¡¾±íÍ·½áµã¡¿ 
+    char data[3];                //¶¥µãÐÅÏ¢--ÿ¸ö¶¥µãµÄÊý¾ÝÊÇÒ»¸öÓÉ3¸ö×Ö·û×é³ÉµÄ×Ö·û´®£¨»ò×Ö·ûÊý×飩V0,V1 
+    ArcNode* firstarc;    //Ö¸ÏòµÚÒ»ÌõÒÀ¸½¸Ã¶¥µãµÄ±ßµÄÖ¸Õë
+}VNode; 
+
+typedef struct {
+	VNode vertices[MaxSize];   	//ÁÚ½Ó±í(verticesΪÊý×éÃû) 
+	int vexnum, arcnum;                 //ͼµÄµ±Ç°¶¥µãÊýºÍ±ßÊý
+}ALGragh;
+
+
+//1¡¢¹¹½¨Í¼£º²Î¿¼P151Ëã·¨6.2
+void InitList(ALGragh &G, char a[][3]) {      
+    int i, j;
+    for (i = 0; i < G.vexnum; i++) {
+		for (j = 0; j < 3; j++) 
+			G.vertices[i].data[j] = a[i][j]; //todo list     //ÊäÈ붥µãÖµ 
+        G.vertices[i].firstarc = NULL; //todo list        //³õʼ»¯±íÍ·½áµãµÄÖ¸ÕëÓòΪNULL  
+    }
+
+    printf("ÇëÊäÈë¸÷±ßËùÒÀ¸½µÄÁ½¸ö¶¥µãµÄλÖÃ\n");
+    for (int k = 0; k < G.arcnum; k++) {
+        scanf("%d %d", &i, &j);
+//Éú³ÉÒ»¸öеı߽áµã*p1:
+        ArcNode* p1 = (ArcNode*)malloc(sizeof(struct ArcNode));    
+ 		p1->adjvex = j;
+        p1->nextarc = G.vertices[i].firstarc;
+        G.vertices[i].firstarc = p1; //todo list  Éè´ËÁÚ½ÓµãÐòºÅΪj£¬²¢½«Ð½áµã*p1²åÈ붥µãviµÄ±ß±íÍ·²¿(Í·²å·¨)
+
+        //Éú³ÉÁíÒ»¸ö¶Ô³ÆµÄеı߽áµã*p2£º
+        ArcNode* p2 = (ArcNode*)malloc(sizeof(struct ArcNode));   
+        p2->adjvex = i;
+        p2->nextarc = G.vertices[j].firstarc;
+        G.vertices[j].firstarc = p2; //todo list  Éè´ËÁÚ½ÓµãÐòºÅΪi£¬²¢½«Ð½áµã*p2²åÈ붥µãvjµÄ±ß±íÍ·²¿(Í·²å·¨)
+    }
+}
+
+
+//2¡¢Êä³öÁÚ½Ó±í
+void PrintInf(ALGragh G) {    
+    int i;
+    ArcNode* p;    //struct ArcNode* p;
+    printf("Êä³öͼµÄÁÚ½Ó±í£º\n");
+    for (i = 0; i < G.vexnum; i++) {                          //G.vexnum±íʾͼÖеĶ¥µãÊýÁ¿¡£
+        printf("%s   ", G.vertices[i].data);                 //´òÓ¡µ±Ç°¶¥µã i µÄÊý¾Ý (%s ±»ÓÃÓÚ±íʾ´ý²åÈëµÄÊý¾ÝÊÇ×Ö·û´®ÀàÐÍ)
+        for (p = G.vertices[i].firstarc; p != NULL; p = p->nextarc)  //forÑ­»·±éÀúµ±Ç°¶¥µã i µÄËùÓÐÁÚ½Ó¶¥µã£¬²¢´òÓ¡ÕâЩÁÚ½Ó¶¥µã¡£
+            printf("%d   ", p->adjvex);
+        printf("\n");
+    }
+}
+
+
+//3¡¢¶Ô²ÉÓá¾ÁÚ½Ó±í¡¿±íʾµÄͼ£¬×öÉî¶ÈÓÅÏȱéÀú£º²Î¿¼P157Ëã·¨6.6
+void DFS_AL(ALGragh G, int visited[], int v) { 
+    printf("%s ", G.vertices[v].data); // ·ÃÎÊµÚ v ¸ö¶¥µã
+	ArcNode* p;
+	int w;
+	visited[v] = 1;
+
+    p = G.vertices[v].firstarc; //todo list     //½« p ³õʼ»¯ÎªÖ¸Ïò¶¥µã v µÄµÚÒ»¸öÁÚ½ÓµãµÄÖ¸Õë  
+    while (p != NULL) { //todo list     //whileÑ­»·£º¶Ôvδ±»·ÃÎʵÄÁÚ½Ó¶¥µãwµÝ¹éµ÷ÓÃDFSTraverse º¯Êý£»²¢Ñ°ÕÒvÏà¶ÔÓÚwµÄÏÂÒ»¸öÁÚ½Óµã
+        w = p->adjvex;
+        if (!visited[w]) {
+            DFS_AL(G, visited, w);
+        }
+        p = p->nextarc;
+    }
+       
+}
+
+//4¡¢Éî¶ÈÓÅÏȱéÀú·ÇÁ¬Í¨Í¼£¨Ò²¼æÈÝÁ¬Í¨Í¼£© £º  ²Î¿¼P156Ëã·¨6.4      £¨¿ÉÓÃÓÚ¼ÆËãÁ¬Í¨·ÖÁ¿µÄ¸öÊý£¬µ«ÐèÒªÔö¼Ócount±äÁ¿£¬ÈçÏÂËã·¨5£© 
+void DFSTraverse_AL(ALGragh G, int visited[]) {   
+    int v;
+    for (v = 0; v < G.vexnum; v++)               //³õʼ»¯±ê¼ÇÊý×é,ÖÃΪ0
+        visited[v] = 0;
+    for (v = 0; v < G.vexnum; v++)
+        if (!visited[v]) { //todo list  Èç¹ûÓж¥µãûÓб»·ÃÎÊ£¬ÄǾÍÒÔËüΪÆðµã±éÀúËùÔÚµÄÁ¬Í¨·ÖÁ¿
+            DFS_AL(G, visited, v);
+        }
+    printf("\n");
+}
+
+
+
+//5¡¢¼ÆËãÁ¬Í¨·ÖÁ¿µÄ¸öÊý
+void Count(ALGragh G, int visited[]) {    
+    int count = 0, v;
+    for (v = 0; v < G.vexnum; v++)               //³õʼ»¯±ê¼ÇÊý×é,ÖÃΪ0
+        visited[v] = 0;
+    for (v = 0; v < G.vexnum; v++)
+        if (!visited[v]) { //todo list  Èç¹ûÓж¥µãûÓб»·ÃÎÊ£¬ÄǾÍÒÔËüΪÆðµã±éÀúËùÔÚµÄÁ¬Í¨·ÖÁ¿£¬Á¬Í¨·ÖÁ¿¸öÊý¼ÓÒ»
+            DFS_AL(G, visited, v);
+            count++;
+        }
+    printf("\n");
+    printf("Á¬Í¨·ÖÁ¿¸öÊý:%d\n", count);
+}
+
+
+//6¡¢ÅжÏÓÐÎÞ·¾¶¿É´ï
+void Judge(ALGragh G, int visited[], int v, int u) {    
+	for (int i = 0; i < G.vexnum; i++)
+        visited[i] = 0;
+    DFS_AL(G, visited, v); //todo list  ÒÔv×÷ΪÆðµã£¬×öÉî¶ÈÓÅÏȱéÀúͼ£¬Ôڴ˹ý³ÌÖв»¶Ï½«ËùÓÐÏ໥Á¬½ÓµÄÁÚ½Ó½áµãµÄvisited[u]¸üÐÂΪ1
+    if (visited[u] == 1){
+        printf("\n");
+		printf("V%dÓëV%dÓз¾¶¿É´ï!\n", v, u);
+	}
+    else{
+    	printf("\n");
+        printf("V%dÓëV%dÎÞ·¾¶¿É´ï!\n", v, u);
+    }
+}
+
+
+
+int main() {
+    int v, u;    //jÊDZߵÄÊýÄ¿,v¡¢uΪ¶¥µãλÖÃ
+	int choose = -1;
+	//aÊÇÒ»¸ö¶þά×Ö·ûÊý×飬´æ´¢¶¥µãÐÅÏ¢(×Ö·û´®»¹µÃ±£´æ½áβµÄ¿Õ×Ö·û\0£¬Òò´ËÁÐÊýÐèÒªÉèΪ3)
+	char a[MaxSize][3] = { "V0", "V1", "V2", "V3", "V4", "V5", "V6", "V7" };  
+	int visited[MaxSize] = { 0 };
+	ALGragh G;
+	G.vexnum = MaxSize;
+
+	printf("*****************************************************\n");
+	printf("**********               ʵÑé°Ë               *******\n");
+	printf("*****************************************************\n");
+	printf("**********     1.¹¹½¨Í¼                       *******\n");
+	printf("**********     2.Êä³öÁÚ½Ó±í                   *******\n");
+	printf("**********     3.Éî¶ÈÓÅÏȱéÀúµÄ½á¹û             *******\n");
+	printf("**********     4.ÅжÏÁ½¸öµãÖ®¼äÊÇ·ñÓз¾¶¿É´ï *******\n");
+	printf("**********     5.Êä³öÁ¬Í¨·ÖÁ¿µÄ¸öÊý           *******\n");
+	printf("**********     0.Í˳ö                         *******\n");
+	printf("*****************************************************\n");
+	while(choose) {
+		printf("ÇëÊäÈëÄãµÄÑ¡ÔñÏ");
+		scanf("%d", &choose);
+		switch(choose){
+			case 1:
+				printf("ÊäÈë±ßÊý:");
+				scanf("%d", &G.arcnum);
+				InitList(G, a);
+				break;
+			case 2:
+				PrintInf(G);
+				break;
+			case 3:	
+				printf("Éî¶ÈÓÅÏȱéÀú½á¹û£º");
+    			DFSTraverse_AL(G, visited);  // 3 Éî¶ÈÓÅÏȱéÀúͼ
+    			//DFS_AL(G, visited,v);   //Èç¹ûÊÇÒ»¸öÁ¬Í¨Í¼£¬Ö±½Óµ÷Óà DFS_ALÒ²¿ÉÒԵõ½ÕýÈ·½á¹û 
+    			printf("\n");
+    			break;
+			case 4:
+				printf("ÊäÈëÒªÅжϵÄÁ½¸öµã:");
+				scanf("%d %d", &v, &u);
+				Judge(G, visited, v, u); 
+				break;
+			case 5:
+				Count(G, visited);
+				break;
+			case 0:
+				exit(0);
+				break;
+		}
+	}
+
+    return 0;
+}