给定一个二叉树,找出其最小深度。
最小深度是从根节点到最近叶子节点的最短路径上的节点数量。
说明: 叶子节点是指没有子节点的节点。
示例:
给定二叉树 [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
返回它的最小深度 2.
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/minimum-depth-of-binary-tree
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
Java
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public int minDepth(TreeNode root) {
if (root == null) return 0;
Queue<TreeNode> queue = new LinkedList<>();
queue.add(root);
int ans = 0;
while (!queue.isEmpty()) {
int size = queue.size();
ans++;
for(int i = 0; i < size; i++) {
TreeNode poll = queue.poll();
if(poll.left == null && poll.right == null) {
return ans;
} else {
if(poll.left != null) queue.add(poll.left);
if(poll.right != null) queue.add(poll.right);
}
}
}
return ans;
}
}
python
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def minDepth(self, root: TreeNode) -> int:
if root == None:
return 0
queue = [root]
ans = 0
while queue:
ans += 1
for i in range(0,len(queue)):
poll = queue.pop(0)
if poll.left == None and poll.right == None:
return ans
else:
if poll.right:
queue.append(poll.right)
if poll.left:
queue.append(poll.left)
return ans