From fba69551b54148d6d7bbd288b8357091851b556e Mon Sep 17 00:00:00 2001 From: jf-home Date: Sun, 23 Jun 2024 21:37:58 +0800 Subject: [PATCH] =?UTF-8?q?README=E6=B7=BB=E5=8A=A0=E6=A0=91?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- README.md | 6 +++++- test/tree_test.c | 3 ++- 2 files changed, 7 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index de71b2d..d1098bc 100644 --- a/README.md +++ b/README.md @@ -7,6 +7,8 @@ > 标准：--std=c99 +[数据结构详细说明](http://wenjianfeng.top) + ## 数据结构 |数据结构 | 原理 |说明 | |---|---|---| @@ -20,4 +22,6 @@ | queue_init2 | 数组 | FIFO/空/满 | | **deque** | |**双端队列** | | deque_init | 双向循环链表 | | - +| **tree** | |**树** | +| tree_avl_init | 二叉搜索树 | AVL树 | +| tree_rb_init | 二叉搜索树 | 红黑树 | diff --git a/test/tree_test.c b/test/tree_test.c index 02abf9c..74142f8 100644 --- a/test/tree_test.c +++ b/test/tree_test.c @@ -331,6 +331,7 @@ void test_tree_num(void) tree->breadth(tree, tree->_root); printf("\n"); +#if 0 while(!tree->empty(tree)) { tree->delete(tree, &temp); @@ -340,7 +341,7 @@ void test_tree_num(void) printf("size = %2d\n", tree->size(tree)); } - +#endif tree_free(tree); }