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

Remove all the table captions.

Browse Source
This commit is contained in:
krahets
2023-02-26 18:23:11 +08:00
parent 9e99ac06ce
commit 7aa44d212c
9 changed files with 0 additions and 22 deletions
Download Patch File Download Diff File Expand all files Collapse all files
docs/chapter_tree/binary_tree_traversal.md
-4
View File
@@ -12,8 +12,6 @@
![二叉树的层序遍历](binary_tree_traversal.assets/binary_tree_bfs.png)
<p align="center"> Fig. 二叉树的层序遍历 </p>
### 算法实现
广度优先遍历一般借助「队列」来实现。队列的规则是“先进先出”，广度优先遍历的规则是 ”一层层平推“ ，两者背后的思想是一致的。
@@ -92,8 +90,6 @@
![二叉搜索树的前、中、后序遍历](binary_tree_traversal.assets/binary_tree_dfs.png)
<p align="center"> Fig. 二叉树的前 / 中 / 后序遍历 </p>
<div class="center-table" markdown>
| 位置 | 含义 | 此处访问结点时对应 |