Tree - 111. Minimum Depth of Binary Tree
Tree - 111. Minimum Depth of Binary Tree
ppxai
发布于 2020-09-23 17:31:33
发布于 2020-09-23 17:31:33
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 7return its minimum depth = 2.
思路：
求二叉树的最小深度，可以采用深度优先搜索递归求解。
代码：
go：
/**
* Definition for a binary tree node.
* type TreeNode struct {
* Val int
* Left *TreeNode
* Right *TreeNode
* }
*/
func minDepth(root *TreeNode) int {
if root == nil {
return 0
}
left, right := minDepth(root.Left), minDepth(root.Right)
if left == 0 || right == 0 {
return left + right + 1
}
if (left > right) {
return right + 1
}
return left + 1
}本文参与 腾讯云自媒体分享计划，分享自作者个人站点/博客。
原始发表：2019年08月19日，如有侵权请联系 cloudcommunity@tencent.com 删除
评论
登录后参与评论
推荐阅读