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
32
33
34
| // @Title: 二叉树的层序遍历 (Binary Tree Level Order Traversal)
// @Author: 15816537946@163.com
// @Date: 2020-08-30 11:13:24
// @Runtime: 0 ms
// @Memory: 2.9 MB
/**
* Definition for a binary tree node.
* type TreeNode struct {
* Val int
* Left *TreeNode
* Right *TreeNode
* }
*/
func levelOrder(root *TreeNode) [][]int {
var ret [][]int
var travel func(*TreeNode, int)
travel = func(node *TreeNode, flag int) {
if node == nil {
return
}
if flag >= len(ret) {
ret = append(ret, []int{})
}
ret[flag] = append(ret[flag], node.Val)
travel(node.Left, flag+1)
travel(node.Right, flag+1)
}
travel(root, 0)
return ret
}
|