-
Notifications
You must be signed in to change notification settings - Fork 0
/
513.go
38 lines (35 loc) · 669 Bytes
/
513.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
package medium
/**
* Definition for a binary tree node.
* type TreeNode struct {
* Val int
* Left *TreeNode
* Right *TreeNode
* }
*/
type TreeNode struct {
Val int
Left *TreeNode
Right *TreeNode
}
func findBottomLeftValue(root *TreeNode) (ans int) {
if root == nil {
return
}
//层序遍历
queue := []*TreeNode{root}
for len(queue) > 0 {
ans = queue[0].Val
for i, n := 0, len(queue); i < n; i++ {
node := queue[0]
queue = queue[1:]
if node.Left != nil {
queue = append(queue, node.Left)
}
if node.Right != nil {
queue = append(queue, node.Right)
}
}
}
return
}