Skip to content

更正文案 #10

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

更正文案 #10

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion 9.数据结构之树的代码实现（二）.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -70,7 +70,7 @@ print_r( $tree );

下面依然通过纸笔演练来搞定三种遍历方式，二叉树就采用程序中建立好的那个二叉树：

- 前序遍历：一定记着，前序遍历的顺序是先遍历根节点，然后再前序遍历根节点的右子树，最后再前序遍历根节点的右子树！前序遍历中继续前序遍历！
- 前序遍历：一定记着，前序遍历的顺序是先遍历根节点，然后再前序遍历根节点的左子树，最后再前序遍历根节点的右子树！前序遍历中继续前序遍历！

![](http://static.ti-node.com/6404568204512854016)

Expand Down