algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 19:44:45 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 二叉树的递归遍历.md

Browse Source
This commit is contained in:
zjd
2021-05-12 11:44:30 +08:00
committed by GitHub
parent 60c1908c4d
commit 08efaac9f7
1 changed files with 30 additions and 30 deletions
Download Patch File Download Diff File Expand all files Collapse all files

60
problems/二叉树的递归遍历.md
View File

@ -125,17 +125,17 @@ Go：
前序遍历: 前序遍历:
``` ```
func PreorderTraversal(root *TreeNode) (res []int) { func PreorderTraversal(root *TreeNode) (res []int) {
var traversal func(node *TreeNode) var traversal func(node *TreeNode)
traversal = func(node *TreeNode) { traversal = func(node *TreeNode) {
if node == nil { if node == nil {
return return
}
res = append(res,node.Val)
traversal(node.Left)
traversal(node.Right)
} }
traversal(root) res = append(res,node.Val)
return res traversal(node.Left)
traversal(node.Right)
}
traversal(root)
return res
} }
``` ```
@ -143,34 +143,34 @@ func PreorderTraversal(root *TreeNode) (res []int) {
``` ```
func InorderTraversal(root *TreeNode) (res []int) { func InorderTraversal(root *TreeNode) (res []int) {
var traversal func(node *TreeNode) var traversal func(node *TreeNode)
traversal = func(node *TreeNode) { traversal = func(node *TreeNode) {
if node == nil { if node == nil {
return return
}
traversal(node.Left)
res = append(res,node.Val)
traversal(node.Right)
} }
traversal(root) traversal(node.Left)
return res res = append(res,node.Val)
traversal(node.Right)
}
traversal(root)
return res
} }
``` ```
后序遍历: 后序遍历:
``` ```
func PostorderTraversal(root *TreeNode) (res []int) { func PostorderTraversal(root *TreeNode) (res []int) {
var traversal func(node *TreeNode) var traversal func(node *TreeNode)
traversal = func(node *TreeNode) { traversal = func(node *TreeNode) {
if node == nil { if node == nil {
return return
}
traversal(node.Left)
traversal(node.Right)
res = append(res,node.Val)
} }
traversal(root) traversal(node.Left)
return res traversal(node.Right)
res = append(res,node.Val)
}
traversal(root)
return res
} }
``` ```