CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-13 18:00:18 +08:00
Code Issues Packages Projects Releases Wiki Activity

build

Browse Source
This commit is contained in:
krahets
2023-05-10 20:59:33 +08:00
parent ccd415c69a
commit 7f43facfd9
5 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
chapter_tree/binary_search_tree.md
View File

@@ -24,7 +24,7 @@ comments: true
- 若 `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)
@@ -620,7 +620,7 @@ comments: true
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)

2
chapter_tree/binary_tree_traversal.md
View File

@@ -651,7 +651,7 @@ comments: true
递归过程可分为“递”和“归”两个相反的部分。“递”表示开启新方法，程序在此过程中访问下一个节点；“归”表示函数返回，代表该节点已经访问完毕。如下图所示，为前序遍历二叉树的递归过程。
=== "<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)