1.编辑器

我使用的是win10+vscode+leetcode+python3
环境配置参见我的博客：
链接

2.第一百一十一题

（1）题目
英文：
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.

中文：
给定一个二叉树，找出其最小深度。

最小深度是从根节点到最近叶子节点的最短路径上的节点数量。

说明: 叶子节点是指没有子节点的节点。

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/minimum-depth-of-binary-tree

（2）解法
① 递归
（耗时： 60ms，内存：15.6M）

class Solution:def minDepth(self, root: TreeNode) -> int:if(not root):return 0if(not root.left):return self.minDepth(root.right)+1if(not root.right):return self.minDepth(root.left)+1return min(self.minDepth(root.left),self.minDepth(root.right))+1

② DFS
（耗时： 56ms，内存：14.9M）

class Solution:def minDepth(self, root: TreeNode) -> int:if(not root):return 0queue = collections.deque([(1,root)])while(queue):depth,node=queue.popleft()if(not node.left and not node.right):return depthif(node.left):queue.append((depth+1,node.left))if(node.right):queue.append((depth+1,node.right))

leetcode python3 简单题111. Minimum Depth of Binary Tree相关推荐

leetcode python3 简单题104. Maximum Depth of Binary Tree
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第一百零四题 (1)题目英文: Given a binary tree, find ...
LeetCode： 111. Minimum Depth of Binary Tree
题目 Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced bina ...
LeetCode 111. Minimum Depth of Binary Tree
原题 Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the s ...
LeetCode 111. Minimum Depth of Binary Tree （二叉树最小的深度）
Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shor ...
111. Minimum Depth of Binary Tree
1.问题描述 Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along t ...
111. Minimum Depth of Binary Tree 二叉树的最小深度
给定一个二叉树,找出其最小深度. 最小深度是从根节点到最近叶子节点的最短路径上的节点数量. 说明: 叶子节点是指没有子节点的节点. 示例: 给定二叉树 [3,9,20,null,null,15,7], ...
LeetCode 111. Minimum Depth of Binary Tree--Java, Python解法--二叉树最小高度--迭代，递归
题目地址:Minimum Depth of Binary Tree - LeetCode Given a binary tree, find its minimum depth. The minimu ...
【LeetCode】Minimum Depth of Binary Tree 二叉树的最小深度 java
[LeetCode]Minimum Depth of Binary Tree Given a binary tree, find its minimum depth. The minimum dept ...
LeetCode:Minimum Depth of Binary Tree,Maximum Depth of Binary Tree
LeetCode:Minimum Depth of Binary Tree Given a binary tree, find its minimum depth. The minimum depth ...

leetcode python3 简单题111. Minimum Depth of Binary Tree

1.编辑器

2.第一百一十一题

leetcode python3 简单题111. Minimum Depth of Binary Tree相关推荐

最新文章

热门文章