apaki/unicstl
1
0
Fork 0
mirror of https://gitee.com/apaki/unicstl.git synced 2025-07-03 23:56:54 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

测试示例的显示方式修改

Browse Source
This commit is contained in:
建峰 2024-06-24 17:25:59 +08:00
parent 904c6f99ff
commit 00ae16c777
1 changed files with 13 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

29
test/test_tree.c
View File

@ -296,11 +296,14 @@ void test_tree_num(void)
printf("----- insert -----\n"); printf("----- insert -----\n");
for (i = 0; i < len; i++) for (i = 0; i < len; i++)
{ {
tree->insert(tree, &data[i]); temp = data[i];
tree->insert(tree, &temp);
// printf("----- preorder -----\n"); printf("insert = ");
// tree->preorder(tree, tree->_root); tree->print_obj(&temp);
// printf("\n"); printf("size = %2d : ", tree->size(tree));
tree->preorder(tree, tree->_root);
printf("\n");
} }
printf("----- preorder -----\n"); printf("----- preorder -----\n");
tree->preorder(tree, tree->_root); tree->preorder(tree, tree->_root);
@ -321,19 +324,19 @@ void test_tree_num(void)
printf("----- right priority -----\n"); printf("----- right priority -----\n");
tree->order(tree, true); tree->order(tree, true);
printf("----- preorder -----\n"); printf("----- preorder(right) -----\n");
tree->preorder(tree, tree->_root); tree->preorder(tree, tree->_root);
printf("\n"); printf("\n");
printf("----- inorder -----\n"); printf("----- inorder(right) -----\n");
tree->inorder(tree, tree->_root); tree->inorder(tree, tree->_root);
printf("\n"); printf("\n");
printf("----- postorder -----\n"); printf("----- postorder(right) -----\n");
tree->postorder(tree, tree->_root); tree->postorder(tree, tree->_root);
printf("\n"); printf("\n");
printf("----- breadth -----\n"); printf("----- breadth(right) -----\n");
tree->breadth(tree, tree->_root); tree->breadth(tree, tree->_root);
printf("\n"); printf("\n");
@ -347,18 +350,12 @@ void test_tree_num(void)
for (i = 0; i < len; i++) for (i = 0; i < len; i++)
{ {
temp = data[i]; temp = data[i];
printf("delete = ");
tree->print_obj(&temp);
// delete // delete
tree->delete(tree, &temp); tree->delete(tree, &temp);
printf("delete = ");
tree->print_obj(&temp);
printf("size = %2d : ", tree->size(tree)); printf("size = %2d : ", tree->size(tree));
// printf("----- breadth -----\n");
// tree->breadth(tree, tree->_root);
// printf("----- preorder -----\n");
tree->preorder(tree, tree->_root); tree->preorder(tree, tree->_root);
printf("\n"); printf("\n");
} }