Commit 90ed55b

authored

Update 二叉树的递归遍历.md

修改错别字

1 parent 3d303eb commit 90ed55bCopy full SHA for 90ed55b

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -54,7 +54,7 @@ traversal(cur->left, vec); // 左`
`54`	`54`	`traversal(cur->right, vec); // 右`
`55`	`55`	```
`56`	`56`
`57`		`-单层递归的逻辑就是按照中左右的顺序来处理的,这样二叉树的前序遍历,基本就写完了,在看一下完整代码:`
	`57`	`+单层递归的逻辑就是按照中左右的顺序来处理的,这样二叉树的前序遍历,基本就写完了,再看一下完整代码:`
`58`	`58`
`59`	`59`	`前序遍历:`
`60`	`60`

Comments

(0)