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: 找树左下角的值 (Find Bottom Left Tree Value)
// @Author: 15816537946@163.com
// @Date: 2019-11-25 17:11:17
// @Runtime: 8 ms
// @Memory: 5.5 MB
/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */

func findBottomLeftValue(root *TreeNode) int {
	queue := make([]*TreeNode, 1, 1024)
	queue[0] = root

	for len(queue) > 0 {
		root = queue[0]
		queue = queue[1:]
		if root.Right != nil {
			queue = append(queue, root.Right)
		}
		if root.Left != nil {
			queue = append(queue, root.Left)
		}
	}

	return root.Val
}