1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
| // @Title: 二叉树的中序遍历 (Binary Tree Inorder Traversal)
// @Author: 15816537946@163.com
// @Date: 2020-12-07 09:51:52
// @Runtime: 0 ms
// @Memory: 2 MB
/**
* Definition for a binary tree node.
* type TreeNode struct {
* Val int
* Left *TreeNode
* Right *TreeNode
* }
*/
func inorderTraversal(root *TreeNode) []int {
if root == nil {
return nil
}
res := make([]int, 0)
var travel func(*TreeNode)
travel = func(node *TreeNode) {
if node == nil {
return
}
travel(node.Left)
res = append(res, node.Val)
travel(node.Right)
}
travel(root)
return res
}
|