更新实验报告

1/dp.in

@@ -1,4 +1,7 @@
-70 3
+10 6
-71 100
+1 1
-69 1
+8 4
-1 2
+4 2 
+3 2
+5 3
+2 2

7/s3.c

@@ -259,6 +259,18 @@ void pt(Tree *root) {
     printf("\n");
 }
 
+// 打印二叉树
+void printTree(Tree *root, int level) {
+    if (root == NULL)
+        return;
+    printTree(root->r, level + 1);
+    for (int i = 0; i < level; i++)
+        printf("    ");
+    printf("%d\n", root->val);
+    printTree(root->l, level + 1);
+}
+
+
 int main() {
     freopen("data.in", "r", stdin);
     scanf("%d", &n);
@@ -276,6 +288,8 @@ int main() {
         scanf("%d", &x);
         root = deleteNode(root, x);
         pt(root);
+        printTree(root, 0);
+        printf("----------------\n");
     }
 
     return 0;