描述
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.
最小深度是从根节点到最近叶子节点的最短路径上的节点数量
例子
思路
如果左右子树深度都大于0,则取min(左右子树深度)
否则取max(左右子树深度)
左右子树深度都大于0?有两种判定方式
1:左子树和右子树存在
2:min(左右子树深度)>0
答案
- python
class Solution:
def minDepth(self, root: TreeNode) -> int:
if not root:
return 0
L = self.minDepth(root.left);R = self.minDepth(root.right)
#方法2
return 1+min(L,R) if min(L,R)>0 else 1+max(L,R)
#方法1
'''
if root.left and root.right:
return 1 + min(L,R)
return 1+max(L,R)
- java
class Solution {
public int minDepth(TreeNode root) {
if (root == null)
return 0;
int L = minDepth(root.left), R = minDepth(root.right);
//方法2
return Math.min(L,R)>0? 1+Math.min(L,R):1+Math.max(L,R);
//方法1
/*
if (root.left != null && root.right != null)
return 1 + Math.min(L,R);
return 1 + Math.max(L, R);
*/
}
}