solution.go

package leetcode

/*
 * @lc app=leetcode.cn id=111 lang=golang
 *
 * [111] 二叉树的最小深度
 */

// @lc code=start
/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 * Val int
 * Left *TreeNode
 * Right *TreeNode
 * }
 */

typeTreeNodestruct {
Valint
Left*TreeNode
Right*TreeNode
}

funcminDepth(root*TreeNode) int {
ifroot==nil {
return0
 }
count:=1
queue:= []*TreeNode{root}
forlen(queue) >0 {
l:=len(queue)
fori:=0; i<l; i++ {
node:=queue[i]
ifnode.Left==nil&&node.Right==nil {
returncount
 }
ifnode.Left!=nil {
queue=append(queue, node.Left)
 }
ifnode.Right!=nil {
queue=append(queue, node.Right)
 }
 }
count++
queue=queue[l:]
 }
returncount
}

// @lc code=end