-
Notifications
You must be signed in to change notification settings - Fork 1
/
102.BinaryTreeLevelOrderTraversal.go
80 lines (68 loc) · 1.14 KB
/
102.BinaryTreeLevelOrderTraversal.go
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
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
package main
import (
"fmt"
)
func main() {
fmt.Println(levelOrder(
&TreeNode{
Val: 1,
Left: &TreeNode{
Val: 2,
Right: &TreeNode{
Val: 5,
},
},
Right: &TreeNode{
Val: 3,
Left: &TreeNode{
Val: 6,
},
},
}))
}
// Definition for a binary tree node.
type TreeNode struct {
Val int
Left *TreeNode
Right *TreeNode
}
type Pair struct {
N *TreeNode
Level int
}
func levelOrder(root *TreeNode) [][]int {
queue := []*Pair{{N: root, Level: 0}}
ret := [][]int{}
curLevel := -1
for {
if len(queue) == 0 {
break
}
node := queue[0]
queue = queue[1:]
if node.N == nil {
continue
}
if node.Level != curLevel {
ret = append(ret, []int{node.N.Val})
curLevel++
} else {
ret[len(ret)-1] = append(ret[len(ret)-1], node.N.Val)
}
if node.N.Left != nil {
queue = append(queue, &Pair{N: node.N.Left, Level: curLevel + 1})
}
if node.N.Right != nil {
queue = append(queue, &Pair{N: node.N.Right, Level: curLevel + 1})
}
}
return ret
}
// func r(node *TreeNode, stack []*TreeNode, ret [][]int) {
// if node == nil {
// return
// }
//
// if node.Level
//
// }