From 904c6f99ffe9ea509b1dc78da8b6c2710dce2765 Mon Sep 17 00:00:00 2001
From: wjf-hs <Orig5826@163.com>
Date: Mon, 24 Jun 2024 17:16:07 +0800
Subject: [PATCH] =?UTF-8?q?=E5=A4=A7=E5=8A=9F=E5=91=8A=E6=88=90=EF=BC=81AV?=
 =?UTF-8?q?L=E6=A0=91=E8=B0=83=E8=AF=95=E9=80=9A=E8=BF=87?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 src/tree.c       | 6 ++----
 test/test_tree.c | 8 +++++---
 2 files changed, 7 insertions(+), 7 deletions(-)

diff --git a/src/tree.c b/src/tree.c
index c665392..5543ef4 100644
--- a/src/tree.c
+++ b/src/tree.c
@@ -1875,8 +1875,6 @@ bool tree_avl_delete(struct _tree* self, void* obj)
     {
         return false;
     }
-    // debug
-    self->print_obj(obj);
 
     if((node->left != NULL) && (node->right != NULL))
     {
@@ -2110,7 +2108,7 @@ static struct _tree_node* tree_find_min(struct _tree* self, struct _tree_node* r
     }
     return tree_find_min(self, root->left);
 #else
-    while(root == NULL)
+    while(root != NULL)
     {
         if(root->left != NULL)
         {
@@ -2118,7 +2116,7 @@ static struct _tree_node* tree_find_min(struct _tree* self, struct _tree_node* r
         }
         else
         {
-            break;
+            return root;
         }
     }
     return root;
diff --git a/test/test_tree.c b/test/test_tree.c
index c63ea3e..953a875 100644
--- a/test/test_tree.c
+++ b/test/test_tree.c
@@ -340,8 +340,8 @@ void test_tree_num(void)
 
     printf("----- left priority -----\n");
     tree->order(tree, false);
-    printf("----- breadth -----\n");
-    tree->breadth(tree, tree->_root);
+    printf("----- preorder -----\n");
+    tree->preorder(tree, tree->_root);
     printf("\n");
 
     for (i = 0; i < len; i++)
@@ -350,9 +350,11 @@ void test_tree_num(void)
 
         printf("delete = ");
         tree->print_obj(&temp);
+        // delete
+        tree->delete(tree, &temp);
+
         printf("size = %2d : ", tree->size(tree));
 
-        tree->delete(tree, &temp);
 
         // printf("----- breadth -----\n");
         // tree->breadth(tree, tree->_root);