xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-17 17:26:06 +00:00
Code Issues Packages Projects Releases Wiki Activity

build

Browse Source
This commit is contained in:
krahets
2023-08-17 05:12:05 +08:00
parent f0826da7f6
commit 97c532b228
67 changed files with 1481 additions and 1066 deletions
Download Patch File Download Diff File Expand all files Collapse all files
chapter_tree/binary_tree_traversal.md
+4 -2
View File
@@ -16,7 +16,7 @@ comments: true
![二叉树的层序遍历](binary_tree_traversal.assets/binary_tree_bfs.png)
<p align="center"> Fig. 二叉树的层序遍历 </p>
<p align="center"> 图：二叉树的层序遍历 </p>
广度优先遍历通常借助「队列」来实现。队列遵循“先进先出”的规则，而广度优先遍历则遵循“逐层推进”的规则，两者背后的思想是一致的。
@@ -334,7 +334,7 @@ comments: true
![二叉搜索树的前、中、后序遍历](binary_tree_traversal.assets/binary_tree_dfs.png)
<p align="center"> Fig. 二叉搜索树的前、中、后序遍历 </p>
<p align="center"> 图：二叉搜索树的前、中、后序遍历 </p>
以下给出了实现代码，请配合上图理解深度优先遍历的递归过程。
@@ -794,3 +794,5 @@ comments: true
=== "<11>"
![preorder_step11](binary_tree_traversal.assets/preorder_step11.png)
<p align="center"> 图：前序遍历的递归过程 </p>