leetcode刷题笔记(Golang)--111. Minimum Depth of Binary Tree

111. Minimum Depth of Binary Tree

Given a binary tree, find its minimum depth.

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.

Note: A leaf is a node with no children.

Example:

Given binary tree [3,9,20,null,null,15,7],

3

/
9 20
/
15 7
return its minimum depth = 2.

func minDepth(root *TreeNode) int {
	if root == nil {
		return 0
	}
	if (root.Left == nil) && root.Right == nil {
		return 1
	}
	l := math.MaxInt32
	r := math.MaxInt32
	if root.Left != nil {
		l = minDepth(root.Left)
	}
	if root.Right != nil {
		r = minDepth(root.Right)
	}
	if l < r {
		return l + 1
	}
	return r + 1
}