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

Polish the contents.

Browse Source
This commit is contained in:
krahets
2023-04-06 22:03:46 +08:00
parent 42c89be785
commit b7daddf88f
3 changed files with 6 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files
docs/chapter_tree/binary_tree_traversal.md
+1 -1
View File
@@ -14,7 +14,7 @@
### 算法实现
广度优先遍历一般借助「队列」来实现。队列的规则是“先进先出”，广度优先遍历的规则是 ”一层层平推“ ，两者背后的思想是一致的。
广度优先遍历一般借助「队列」来实现。队列的规则是“先进先出”，广度优先遍历的规则是“一层层平推”，两者背后的思想是一致的。
=== "Java"