Prepare 1.0.0b3 release.

2025-11-02 12:58:42 +08:00 · 2023-05-10 21:00:04 +08:00
parent def8da6617
commit 7ca27c3df1
30 changed files with 6 additions and 6 deletions
--- a/docs/chapter_tree/binary_search_tree.md
+++ b/docs/chapter_tree/binary_search_tree.md
@ -18,7 +18,7 @@
 - 若 `cur.val = num` ，说明找到目标节点，跳出循环并返回该节点；

 === "<1>"
-    ![bst_search_step1](binary_search_tree.assets/bst_search_step1.png)
+    ![二叉搜索树查找节点示例](binary_search_tree.assets/bst_search_step1.png)

 === "<2>"
    ![bst_search_step2](binary_search_tree.assets/bst_search_step2.png)
@ -185,7 +185,7 @@
 3. 用 `tmp` 的值覆盖待删除节点的值；

 === "<1>"
-    ![bst_remove_case3_step1](binary_search_tree.assets/bst_remove_case3_step1.png)
+    ![二叉搜索树删除节点示例](binary_search_tree.assets/bst_remove_case3_step1.png)

 === "<2>"
    ![bst_remove_case3_step2](binary_search_tree.assets/bst_remove_case3_step2.png)
--- a/docs/chapter_tree/binary_tree_traversal.assets/preorder_step1.png
+++ b/docs/chapter_tree/binary_tree_traversal.assets/preorder_step1.png
--- a/docs/chapter_tree/binary_tree_traversal.assets/preorder_step10.png
+++ b/docs/chapter_tree/binary_tree_traversal.assets/preorder_step10.png
--- a/docs/chapter_tree/binary_tree_traversal.assets/preorder_step11.png
+++ b/docs/chapter_tree/binary_tree_traversal.assets/preorder_step11.png
--- a/docs/chapter_tree/binary_tree_traversal.assets/preorder_step2.png
+++ b/docs/chapter_tree/binary_tree_traversal.assets/preorder_step2.png
--- a/docs/chapter_tree/binary_tree_traversal.assets/preorder_step3.png
+++ b/docs/chapter_tree/binary_tree_traversal.assets/preorder_step3.png
--- a/docs/chapter_tree/binary_tree_traversal.assets/preorder_step4.png
+++ b/docs/chapter_tree/binary_tree_traversal.assets/preorder_step4.png
--- a/docs/chapter_tree/binary_tree_traversal.assets/preorder_step5.png
+++ b/docs/chapter_tree/binary_tree_traversal.assets/preorder_step5.png
--- a/docs/chapter_tree/binary_tree_traversal.assets/preorder_step6.png
+++ b/docs/chapter_tree/binary_tree_traversal.assets/preorder_step6.png
--- a/docs/chapter_tree/binary_tree_traversal.assets/preorder_step7.png
+++ b/docs/chapter_tree/binary_tree_traversal.assets/preorder_step7.png
--- a/docs/chapter_tree/binary_tree_traversal.assets/preorder_step8.png
+++ b/docs/chapter_tree/binary_tree_traversal.assets/preorder_step8.png
--- a/docs/chapter_tree/binary_tree_traversal.assets/preorder_step9.png
+++ b/docs/chapter_tree/binary_tree_traversal.assets/preorder_step9.png
--- a/docs/chapter_tree/binary_tree_traversal.md
+++ b/docs/chapter_tree/binary_tree_traversal.md
@ -209,7 +209,7 @@
 递归过程可分为“递”和“归”两个相反的部分。“递”表示开启新方法，程序在此过程中访问下一个节点；“归”表示函数返回，代表该节点已经访问完毕。如下图所示，为前序遍历二叉树的递归过程。

 === "<1>"
-    ![preorder_step1](binary_tree_traversal.assets/preorder_step1.png)
+    ![前序遍历的递归过程](binary_tree_traversal.assets/preorder_step1.png)

 === "<2>"
    ![preorder_step2](binary_tree_traversal.assets/preorder_step2.png)