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

build

Browse Source
This commit is contained in:
krahets
2023-04-06 22:04:07 +08:00
parent 49d81bca03
commit b1a2d8424d
3 changed files with 6 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
chapter_tree/binary_tree_traversal.md
View File

@@ -20,7 +20,7 @@ comments: true
### 算法实现
广度优先遍历一般借助「队列」来实现。队列的规则是“先进先出”，广度优先遍历的规则是 ”一层层平推“ ，两者背后的思想是一致的。
广度优先遍历一般借助「队列」来实现。队列的规则是“先进先出”，广度优先遍历的规则是“一层层平推”，两者背后的思想是一致的。
=== "Java"