<LeetCode><Easy> 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.

#Python  68ms

# 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):
def minDepth(self, root):
"""
:type root: TreeNode
:rtype: int
"""
if not root:return 0
depths=[]
def search(root,n=0):
if not root:depths.append(n);return
n+=1
if not root.left and not root.right:depths.append(n);return
if root.left:
search(root.left,n)
if root.right:
search(root.right,n)
return
search(root)
return min(depths)