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

Merge pull request #405 from betNevS/master

Browse Source 
更新 二叉树的递归遍历 go版本的代码格式
This commit is contained in:
程序员Carl
2021-06-16 20:14:42 +08:00
committed by GitHub
parent 4fdec81dde b3eacc519b
commit e332190cbe
1 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -221,12 +221,12 @@ class Solution:
Go：
前序遍历:
```
```go
func PreorderTraversal(root *TreeNode) (res []int) {
var traversal func(node *TreeNode)
traversal = func(node *TreeNode) {
if node == nil {
return
return
}
res = append(res,node.Val)
traversal(node.Left)
@ -239,12 +239,12 @@ func PreorderTraversal(root *TreeNode) (res []int) {
```
中序遍历:
```
```go
func InorderTraversal(root *TreeNode) (res []int) {
var traversal func(node *TreeNode)
traversal = func(node *TreeNode) {
if node == nil {
return
return
}
traversal(node.Left)
res = append(res,node.Val)
@ -256,12 +256,12 @@ func InorderTraversal(root *TreeNode) (res []int) {
```
后序遍历:
```
```go
func PostorderTraversal(root *TreeNode) (res []int) {
var traversal func(node *TreeNode)
traversal = func(node *TreeNode) {
if node == nil {
return
return
}
traversal(node.Left)
traversal(node.Right)