大功告成!AVL树调试通过

This commit is contained in:
建峰 2024-06-24 17:16:07 +08:00
parent 6dc2271ab8
commit 904c6f99ff
2 changed files with 7 additions and 7 deletions

View File

@ -1875,8 +1875,6 @@ bool tree_avl_delete(struct _tree* self, void* obj)
{ {
return false; return false;
} }
// debug
self->print_obj(obj);
if((node->left != NULL) && (node->right != NULL)) 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); return tree_find_min(self, root->left);
#else #else
while(root == NULL) while(root != NULL)
{ {
if(root->left != NULL) if(root->left != NULL)
{ {
@ -2118,7 +2116,7 @@ static struct _tree_node* tree_find_min(struct _tree* self, struct _tree_node* r
} }
else else
{ {
break; return root;
} }
} }
return root; return root;

View File

@ -340,8 +340,8 @@ void test_tree_num(void)
printf("----- left priority -----\n"); printf("----- left priority -----\n");
tree->order(tree, false); tree->order(tree, false);
printf("----- breadth -----\n"); printf("----- preorder -----\n");
tree->breadth(tree, tree->_root); tree->preorder(tree, tree->_root);
printf("\n"); printf("\n");
for (i = 0; i < len; i++) for (i = 0; i < len; i++)
@ -350,9 +350,11 @@ void test_tree_num(void)
printf("delete = "); printf("delete = ");
tree->print_obj(&temp); tree->print_obj(&temp);
// delete
tree->delete(tree, &temp);
printf("size = %2d : ", tree->size(tree)); printf("size = %2d : ", tree->size(tree));
tree->delete(tree, &temp);
// printf("----- breadth -----\n"); // printf("----- breadth -----\n");
// tree->breadth(tree, tree->_root); // tree->breadth(tree, tree->_root);