【leetcode?python】 111. Minimum Depth of Binary Tree

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    depthList=[]
    def minDepth(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        self.depthList=[]
        if root==None:return 0
        self.depthList.append(1)
        self.dfs(root)
       
        return min(self.depthList)
        
        
    def dfs(self,root):
        
        curdepth=self.depthList[-1]
        
        if root.right!=None or root.left!=None:
            self.depthList.pop()
        else:return
        
        if root.left!=None:
            dep=curdepth+1
            self.depthList.append(dep)
            self.dfs(root.left)
        if root.right!=None:
            dep=curdepth+1
            self.depthList.append(dep)
            self.dfs(root.right)

时间: 10-24

【leetcode?python】 111. Minimum Depth of Binary Tree的相关文章

Leetcode 111. Minimum Depth of Binary Tree

111. Minimum Depth of Binary Tree Total Accepted: 114343 Total Submissions:368035 Difficulty: Easy 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 le

[LeetCode]题解(python):111 Minimum Depth of Binary Tree

题目来源 https://leetcode.com/problems/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. 题意分析 Input: a binary tree

[LeetCode] 111. Minimum Depth of Binary Tree Java

题目: 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. 题意及分析:求一棵二叉树的最低高度,即根节点到叶子节点的最短路径.遍历二叉树,然后用一个变量保存遍历到当前节点的最小路径即可,然后每次遇到叶子节点,就判断当前叶节点高度和先

Java [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 shortest path from the root node down to the nearest leaf node. 解题思路: 递归. 代码描述: /** * Definition for a binary tree node. * public class TreeNode { *

Java for 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 shortest path from the root node down to the nearest leaf node. 解题思路:注意minimum depth最后遍历的那个点,left right都必须为null,JAVA实现如下: public int minDepth(TreeNode roo

111. Minimum Depth of Binary Tree java solutions

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. Subscribe to see which companies asked this question Show Tags Show Similar Problems 1 /**

letecode [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

力扣算法题—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

111. Minimum Depth of Binary Tree

和depth比较像 1 public int minDepth(TreeNode root) { 2 if(root == null) { 3 return 0; 4 } 5 if(root.left == null) { 6 return minDepth(root.right) + 1; 7 } 8 if(root.right == null) { 9 return minDepth(root.left) + 1; 10 } 11 return Math.min(minDepth(root.